Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Formal analysis of composable DeFi protocols
Decentralized finance (DeFi) has become one of the most successful applications of
blockchain and smart contracts. The DeFi ecosystem enables a wide range of crypto …
blockchain and smart contracts. The DeFi ecosystem enables a wide range of crypto …
Time to learn–learning timed automata from tests
Abstract Model learning has gained increasing interest in recent years. It derives
behavioural models from test data of black-box systems. The main advantage offered by …
behavioural models from test data of black-box systems. The main advantage offered by …
Compositional reasoning
D Giannakopoulou, KS Namjoshi… - Handbook of Model …, 2018 - Springer
State Explosion is a fundamental challenge for model checking methods. This term refers to
the potentially exponential growth of the state space of a program as a function of the …
the potentially exponential growth of the state space of a program as a function of the …
Timed automata verification and synthesis via finite automata learning
O Sankur - International Conference on Tools and Algorithms for …, 2023 - Springer
We present algorithms for model checking and controller synthesis of timed automata,
seeing a timed automaton model as a parallel composition of a large finite-state machine …
seeing a timed automaton model as a parallel composition of a large finite-state machine …
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
In this paper, we propose a novel algorithm to learn a Büchi automaton from a teacher who
knows an ω-regular language. The learned Büchi automaton can be a nondeterministic …
knows an ω-regular language. The learned Büchi automaton can be a nondeterministic …
Repairing timed automata clock guards through abstraction and testing
Timed automata (TAs) are a widely used formalism to specify systems having temporal
requirements. However, exactly specifying the system may be difficult, as the user may not …
requirements. However, exactly specifying the system may be difficult, as the user may not …
Learning-based compositional parameter synthesis for event-recording automata
We address the verification of timed concurrent systems with unknown or uncertain
constants considered as parameters. First, we introduce parametric event-recording …
constants considered as parameters. First, we introduce parametric event-recording …
Interpolation guided compositional verification (t)
Model checking suffers from the state space explosion problem. Compositional verification
techniques such as assume-guarantee reasoning (AGR) have been proposed to alleviate …
techniques such as assume-guarantee reasoning (AGR) have been proposed to alleviate …
Learning assumptions for compositional verification of timed automata
H Chen, Y Su, M Zhang, Z Liu, J Mi - International Conference on …, 2023 - Springer
Compositional verification, such as the technique of assume-guarantee reasoning (AGR), is
to verify a property of a system from the properties of its components. It is essential to …
to verify a property of a system from the properties of its components. It is essential to …
Combining genetic programming and model checking to generate environment assumptions
Software verification may yield spurious failures when environment assumptions are not
accounted for. Environment assumptions are the expectations that a system or a component …
accounted for. Environment assumptions are the expectations that a system or a component …