Results 1  10
of
1,019
Global modelchecking of infinitestate systems
 in: Proc. 16th International Conference on Computer Aided Verification, CAV’04, in: LNCS
, 2004
"... Abstract. We extend the automatatheoretic framework for reasoning about infinitestate sequential systems to handle also the global modelchecking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed a ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
Abstract. We extend the automatatheoretic framework for reasoning about infinitestate sequential systems to handle also the global modelchecking problem. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed
Combining Local and Global Model Checking
, 1999
"... The verification process of reactive systems in local model checking [1,7] and in explicit state model checking [13,15] is onthefly. Therefore only those states of a system have to be traversed that are necessary to prove a property. In addition, if the property does not hold, than often only a sm ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
small subset of the state space has to be traversed to produce a counterexample. Global model checking [6,23] and, in particular, symbolic model checking [4,22] can utilize compact representations of the state space, e.g. BDDs [3], to handle much larger designs than what is possible with local
Saturation methods for global modelchecking pushdown systems
, 2009
"... Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite state. By recording the call history on the stack, these systems provide a natural model for recursive procedure calls. Modelchecking for pushdown systems has been wellstudied. Tools implementing pus ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
. These systems form a robust hierarchy closely related to the Caucal hierarchy and higherorder recursion schemes. This latter connection demonstrates their importance as models for programs with higherorder functions. We study the global modelchecking problem for (higherorder) pushdown systems. In particular
Global ModelChecking of HigherOrder Pushdown Systems
, 2008
"... Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite state. By recording the call history on the stack, these systems provide a natural model for recursive procedure calls. Modelchecking for pushdown systems has been wellstudied. The most successful im ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
hierarchy closely related to the Caucal hierarchy and higherorder recursion schemes. This latter connection demonstrates their importance as models for programs with higherorder functions. We study the global modelchecking problem for higherorder pushdown systems. In particular, we show how to compute
Efficient Local and Global Model Checking
"... any t 2 T we define the firing relation t ! : 2 P 7! 2 P as follows: 1 t ! 2 if pre(t) ` 1 , post(t) " 1 = ;, and 2 = ( 1 n pre(t)) [ post(t). The reachable state space of an EPN is the smallest set of markings containing 0 which is closed under all firing relations. An execution ..."
Abstract
 Add to MetaCart
any t 2 T we define the firing relation t ! : 2 P 7! 2 P as follows: 1 t ! 2 if pre(t) ` 1 , post(t) " 1 = ;, and 2 = ( 1 n pre(t)) [ post(t). The reachable state space of an EPN is the smallest set of markings containing 0 which is closed under all firing relations. An execution is a maximal path through the reachable state space. The EPN is deadlockfree if every execution is infinite. Temporal Logic was invented by philosophers to formally duplicate natural language sentence
Global model checking of ordered multipushdown systems
 Schloss Dagstuhl  LeibnizZentrum fuer Informatik
, 2010
"... In this paper, we address the verification problem of ordered multipushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations such that a pop can only be performed on the first nonempty stack. First, we show that for an ordered multipushdown syst ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
pushdown system the set of all predecessors of a regular set of configurations is an effectively constructible regular set. Then, we exploit this result to solve the global model checking which consists in computing the set of all configurations of an ordered multipushdown system that satisfy a given w
Multiple State and Single State Tableaux for Combining Local and Global Model Checking
 IN CORRECT SYSTEM DESIGN
, 1999
"... The verification process of reactive systems in local model checking [2, 9, 28] and in explicit state model checking [14, 16] is onthefly. Therefore only those states of a system have to be traversed that are necessary to prove a property. In addition, if the property does not hold, than ofte ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
often only a small subset of the state space has to be traversed to produce a counterexample. Global model checking [8, 24] and, in particular, symbolic model checking [6, 23] can utilize compact representations of the state space, e.g. BDDs [5], to handle much larger designs than what is possible
TR 26/98 University of Karlsruhe Combining Local and Global Model Checking
"... Abstract. The verification process of reactive systems in local model checking [2, 9, 28] and in explicit state model checking [14, 16] is onthefly. Therefore only those states of a system have to be traversed that are necessary to prove a property. In addition, if the property does not hold, than ..."
Abstract
 Add to MetaCart
, than often only a small subset of the state space has to be traversed to produce a counterexample. Global model checking [8, 24] and, in particular, symbolic model checking [6, 23] can utilize compact representations of the state space, e.g. BDDs [5], to handle much larger designs than what is possible
On Global Model Checking Trees Generated by HigherOrder Recursion Schemes
, 2009
"... Higherorder recursion schemes are systems of rewrite rules on typed nonterminal symbols, which can be used to define infinite trees. The Global Modal MuCalculus Model Checking Problem takes as input such a recursion scheme together with a modal µcalculus sentence and asks for a finite representa ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Higherorder recursion schemes are systems of rewrite rules on typed nonterminal symbols, which can be used to define infinite trees. The Global Modal MuCalculus Model Checking Problem takes as input such a recursion scheme together with a modal µcalculus sentence and asks for a finite
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract

Cited by 3252 (70 self)
 Add to MetaCart
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type
Results 1  10
of
1,019