AbstractVerifying temporal specifications of reactive and concurrent systems commonly relies on generating auxiliary assertions and on strengthening given properties of the system. This can be achieved by two dual approaches: The bottom-up method performs an abstract forward propagation (computation) of the system, generating auxiliary assertions; the top-down method performs an abstract backward propagation to strengthen given properties. Exact application of these methods is complete but is usually infeasible for large-scale verification. Approximation techniques are often needed to complete the verification.We give an overview of known methods for generation of auxiliary invariants in the verification of invariance properties. We extend ...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
Abstract. We study the uniform verification problem for infinite state processes, which consists of ...
Abstract. We describe two complementary techniques to aid the automatic ver-ification of safety prop...
Verifying temporal specifications of reactive and concurrent systems commonly relies on generating a...
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance an...
The concept of invariant is the basis of most formal methods for the design and verification of conc...
When proving invariance properties of programs one is faced with two problems. The first problem is ...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
AbstractThe paper deals with the proof method of verification by finitary abstraction (VFA), which p...
We present a technique designed to automatically compute predicate abstractions for dense real-timed...
Colloque avec actes et comité de lecture. internationale.International audienceWe define a class of ...
This thesis proposes a diagram-based formalism for verifying temporal properties of reactive systems...
Fully automated verification of concurrent programs is a difficult problem, primarily because of sta...
The scope of immediate assertions in SystemVerilog is restricted to Boolean properties, where as tem...
Counterexamples explain why a desired temporal logic property fails to hold. The generation of count...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
Abstract. We study the uniform verification problem for infinite state processes, which consists of ...
Abstract. We describe two complementary techniques to aid the automatic ver-ification of safety prop...
Verifying temporal specifications of reactive and concurrent systems commonly relies on generating a...
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance an...
The concept of invariant is the basis of most formal methods for the design and verification of conc...
When proving invariance properties of programs one is faced with two problems. The first problem is ...
Program verification increases the degree of confidence that a program will perform correctly. Manua...
AbstractThe paper deals with the proof method of verification by finitary abstraction (VFA), which p...
We present a technique designed to automatically compute predicate abstractions for dense real-timed...
Colloque avec actes et comité de lecture. internationale.International audienceWe define a class of ...
This thesis proposes a diagram-based formalism for verifying temporal properties of reactive systems...
Fully automated verification of concurrent programs is a difficult problem, primarily because of sta...
The scope of immediate assertions in SystemVerilog is restricted to Boolean properties, where as tem...
Counterexamples explain why a desired temporal logic property fails to hold. The generation of count...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
Abstract. We study the uniform verification problem for infinite state processes, which consists of ...
Abstract. We describe two complementary techniques to aid the automatic ver-ification of safety prop...