Colloque avec actes et comité de lecture. internationale.International audienceWe define a class of diagrams that represent abstractions of---possibly infinite-state---reactive systems described by specifications written in temporal logic. Our diagrams are intended as the basis for the verification of both safety and liveness properties of such systems. Non-temporal proof obligations establish the correspondence between the original specification and the diagram, whereas model checking can be used to verify properties over finite-state abstractions. We describe the use of abstract interpretation techniques to generate proof diagrams from a given specification and user-defined predicates that represent sets of states
We present an automated abstract verification method for infinite-state systems specified by logic p...
This paper presents how predicate abstraction can be applied to protocol verification. Predicate abs...
ion of Systems with Counters for Symbolic Model Checking # Klaus Schneider and George Logothetis U...
Abstract: We define a class of predicate diagrams that represent abstractions of—possibly infinite-s...
This thesis proposes a diagram-based formalism for verifying temporal properties of reactive systems...
We define a class of predicate diagrams that represent abstractions of - possibly infinite-state - r...
Graphical formalisms are an increasingly important component of our research on the specification an...
Computers are frequently used in critical applications where predictable response times are essentia...
AbstractWe propose a format of predicate diagrams for the verification of real-time systems. We cons...
AbstractThe paper deals with the proof method of verification by finitary abstraction (VFA), which p...
to appear in Electronic Notes in Theoretical Computer Science - ENTCS/http://www.dcs.warwick.ac.uk/p...
This thesis provides an efficient formal scheme for the tool-supported real-time system verification...
We present an algorithm that uses decision procedures to generate finite-state abstractions of possi...
The advent of ever more complex reactive systems in increasingly critical areas calls for the develo...
The task of designing large real-time reactive systems, which interact continuously with their envir...
We present an automated abstract verification method for infinite-state systems specified by logic p...
This paper presents how predicate abstraction can be applied to protocol verification. Predicate abs...
ion of Systems with Counters for Symbolic Model Checking # Klaus Schneider and George Logothetis U...
Abstract: We define a class of predicate diagrams that represent abstractions of—possibly infinite-s...
This thesis proposes a diagram-based formalism for verifying temporal properties of reactive systems...
We define a class of predicate diagrams that represent abstractions of - possibly infinite-state - r...
Graphical formalisms are an increasingly important component of our research on the specification an...
Computers are frequently used in critical applications where predictable response times are essentia...
AbstractWe propose a format of predicate diagrams for the verification of real-time systems. We cons...
AbstractThe paper deals with the proof method of verification by finitary abstraction (VFA), which p...
to appear in Electronic Notes in Theoretical Computer Science - ENTCS/http://www.dcs.warwick.ac.uk/p...
This thesis provides an efficient formal scheme for the tool-supported real-time system verification...
We present an algorithm that uses decision procedures to generate finite-state abstractions of possi...
The advent of ever more complex reactive systems in increasingly critical areas calls for the develo...
The task of designing large real-time reactive systems, which interact continuously with their envir...
We present an automated abstract verification method for infinite-state systems specified by logic p...
This paper presents how predicate abstraction can be applied to protocol verification. Predicate abs...
ion of Systems with Counters for Symbolic Model Checking # Klaus Schneider and George Logothetis U...