Formal analysis of composable DeFi protocols

P Tolmach, Y Li, SW Lin, Y Liu - International Conference on Financial …, 2021 - Springer
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 …

Time to learn–learning timed automata from tests

M Tappler, BK Aichernig, KG Larsen… - Formal Modeling and …, 2019 - Springer
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 …

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 …

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 …

A novel learning algorithm for Büchi automata based on family of DFAs and classification trees

Y Li, YF Chen, L Zhang, D Liu - Information and Computation, 2021 - Elsevier
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 …

Repairing timed automata clock guards through abstraction and testing

É André, P Arcaini, A Gargantini… - … Conference on Tests and …, 2019 - Springer
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 …

Learning-based compositional parameter synthesis for event-recording automata

É André, SW Lin - … Techniques for Distributed Objects, Components, and …, 2017 - Springer
We address the verification of timed concurrent systems with unknown or uncertain
constants considered as parameters. First, we introduce parametric event-recording …

Interpolation guided compositional verification (t)

SW Lin, J Sun, TK Nguyen, Y Liu… - 2015 30th IEEE/ACM …, 2015 - ieeexplore.ieee.org
Model checking suffers from the state space explosion problem. Compositional verification
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 …

Combining genetic programming and model checking to generate environment assumptions

K Gaaloul, C Menghi, S Nejati… - IEEE Transactions …, 2021 - ieeexplore.ieee.org
Software verification may yield spurious failures when environment assumptions are not
accounted for. Environment assumptions are the expectations that a system or a component …