[BOOK][B] Handbook of model checking
This handbook is intended to give an in-depth description of the many research areas that
make up the expanding field of model checking. In 32 chapters, 76 of the world's leading …
make up the expanding field of model checking. In 32 chapters, 76 of the world's leading …
Paxos made EPR: decidable reasoning about distributed protocols
Distributed protocols such as Paxos play an important role in many computer systems.
Therefore, a bug in a distributed protocol may have tremendous effects. Accordingly, a lot of …
Therefore, a bug in a distributed protocol may have tremendous effects. Accordingly, a lot of …
Trustworthy autonomous system development
Autonomous systems emerge from the need to progressively replace human operators by
autonomous agents in a wide variety of application areas. We offer an analysis of the state of …
autonomous agents in a wide variety of application areas. We offer an analysis of the state of …
On symmetry and quantification: A new approach to verify distributed protocols
Proving that an unbounded distributed protocol satisfies a given safety property amounts to
finding a quantified inductive invariant that implies the property for all possible instance …
finding a quantified inductive invariant that implies the property for all possible instance …
A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
Distributed algorithms have many mission-critical applications ranging from embedded
systems and replicated databases to cloud computing. Due to asynchronous …
systems and replicated databases to cloud computing. Due to asynchronous …
Modularity for decidability of deductive verification with applications to distributed systems
Proof automation can substantially increase productivity in formal verification of complex
systems. However, unpredictablility of automated provers in handling quantified formulas …
systems. However, unpredictablility of automated provers in handling quantified formulas …
Parameter Synthesis for Markov Models: Covering the Parameter Space
Markov chain analysis is a key technique in formal verification. A practical obstacle is that all
probabilities in Markov models need to be known. However, system quantities such as …
probabilities in Markov models need to be known. However, system quantities such as …
Verifying Solidity Smart Contracts via Communication Abstraction in SmartACE
Solidity smart contract allow developers to formalize financial agreements between users.
Due to their monetary nature, smart contracts have been the target of many high-profile …
Due to their monetary nature, smart contracts have been the target of many high-profile …
Reducing liveness to safety in first-order logic
We develop a new technique for verifying temporal properties of infinite-state (distributed)
systems. The main idea is to reduce the temporal verification problem to the problem of …
systems. The main idea is to reduce the temporal verification problem to the problem of …
Parameterized model checking of rendezvous systems
Parameterized model checking is the problem of deciding if a given formula holds
irrespective of the number of participating processes. A standard approach for solving the …
irrespective of the number of participating processes. A standard approach for solving the …