Results 1  10
of
540,314
Combination Methods for Satisfiability and ModelChecking of InfiniteState Systems. Accepted for publication
 in CADE 2007. Available at http://homes.dsi.unimi.it/ ∼ zucchell/publications/conference/ GhiNiRaZuCADE07.pdf
"... Abstract. Manna and Pnueli have extensively shown how a mixture of firstorder logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a r ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
reactive system while LTL specifies its (dynamic) behavior. In this paper, we derive undecidability and decidability results for both the satisfiability of (quantifierfree) formulae and the modelchecking of safety properties by lifting combination methods for (nondisjoint) theories in FOL. The proofs
Combination Methods for Satisfiability and ModelChecking of InfiniteState Systems
, 2007
"... Manna and Pnueli have extensively shown how a mixture of firstorder logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the vast class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a reacti ..."
Abstract
 Add to MetaCart
reactive system while LTL specifies its (dynamic) behavior. The combination of LTL and FOL allows us to specify infinite state systems and the subtle ways in which their data flow influences the control flow. Indeed, the capability of automatically solving satisfiability and modelchecking problems
Combination Methods for ModelChecking of InfiniteState Systems ∗
"... Manna and Pnueli have extensively shown how a mixture of firstorder logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems for the class of reactive systems. Theories in FOL model the (possibly infinite) data structures used by a reactive sys ..."
Abstract
 Add to MetaCart
in FOL and the exploration of a safety graph (associated to the system) can be integrated. This paves the way to employ efficient Satisfiability Modulo Theories solvers in the modelchecking of infinite state systems. We illustrate our technique on an example. 1
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 329 (7 self)
 Add to MetaCart
Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends
On Model Checking InfiniteState Systems
 In Nerode and Matiyasevich, editors, LFCS'94: Logic at St. Petersburg. Symposium on Logical Foundations of Computer Science
, 1994
"... This paper presents a proof method for proving that infinitestate systems satisfy properties expressed in the modal ¯calculus. The method is sound and complete relative to externally proving inclusions of sets of states. It can be seen as a recast of a tableau method due to Bradfield and Stirling ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper presents a proof method for proving that infinitestate systems satisfy properties expressed in the modal ¯calculus. The method is sound and complete relative to externally proving inclusions of sets of states. It can be seen as a recast of a tableau method due to Bradfield and Stirling
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 385 (39 self)
 Add to MetaCart
modelchecking for branchingtime logics), we consider the more general class of alternating pushdown systems and use alternating finitestate automata as a representation structure for their sets of configurations. We give a simple and natural procedure to compute sets of predecessors
Infinitestate highlevel MSCs: Modelchecking and realizability
 In ICALP 2002, volume 2380 of LNCS
, 2002
"... Abstract. We consider three natural classes of infinitestate HMSCs: ..."
Abstract

Cited by 33 (7 self)
 Add to MetaCart
Abstract. We consider three natural classes of infinitestate HMSCs:
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 910 (74 self)
 Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
Verification of Infinitestate Systems
, 2000
"... ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Wellstructured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over onecounter processes 12 12 Deciding rstorder nonregular ..."
Abstract
 Add to MetaCart
regular Properties of PAProcesses 12 13 Decision procedures for pushdown automata with transitions 13 14 Model Checking Pushdown Graphs 13 15 Acceleration of innite loops 14 16 Ecient Algorithms for ModelChecking Pushdown Systems 15 17 Heterogeneous Finitestate Representation Systems 15 18 Temporal logics
Results 1  10
of
540,314