Results 1  10
of
281
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
of states. We describe a general method that represents the state space symbolical/y instead of explicitly. The generality of our method comes from using a dialect of the MuCalculus as the primary specification language. We describe a model checking algorithm for MuCalculus formulas that uses Bryant’s
A SweepLine Method for State Space Exploration
, 2001
"... We present a state space exploration methodf or onthefly verification. The method is aimed at systems for which it is possible to define a measure of progress based on the states of the system. The measure of progress makes it possible to delete certain states onthefly during state space generat ..."
Abstract

Cited by 52 (23 self)
 Add to MetaCart
of the method on a number of Coloured Petri Net models, and give a first evaluation of its practicality by means of an implementation based on the Design/CPN state space tool. Our experiments show significant reductions in both space and time used during state space exploration. The method is not specific
Model Checking for Programming Languages using VeriSoft
 IN PROCEEDINGS OF THE 24TH ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 1997
"... Verification by statespace exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing modelchecking techniques are restricted to the verification of ..."
Abstract

Cited by 446 (15 self)
 Add to MetaCart
Verification by statespace exploration, also often referred to as "model checking", is an effective method for analyzing the correctness of concurrent reactive systems (e.g., communication protocols). Unfortunately, existing modelchecking techniques are restricted to the verification
Combining the SweepLine Method with the use of an Externalmemory Priority Queue ⋆
"... Abstract. The sweepline method is an explicitstate model checking technique that uses a notion of progress to delete states from internal memory during state space exploration and thereby reduce peak memory usage. The sweepline algorithm relies on the use of a priority queue where the progress va ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The sweepline method is an explicitstate model checking technique that uses a notion of progress to delete states from internal memory during state space exploration and thereby reduce peak memory usage. The sweepline algorithm relies on the use of a priority queue where the progress
Checking Language Inclusion OntheFly with the Sweepline Method
, 2005
"... The sweepline state space method allows states to be deleted from memory during state exploration, thus alleviating state explosion. Properties of the system (such as the absence of deadlocks) can then be verified onthefly. This paper presents an extension to the sweepline method that allows o ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The sweepline state space method allows states to be deleted from memory during state exploration, thus alleviating state explosion. Properties of the system (such as the absence of deadlocks) can then be verified onthefly. This paper presents an extension to the sweepline method that allows
PartialOrder Methods for the Verification of Concurrent Systems  An Approach to the StateExplosion Problem
, 1995
"... Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy to ..."
Abstract

Cited by 368 (12 self)
 Add to MetaCart
to use: they are fully automatic. Moreover, the range of properties that they can verify has been substantially broadened thanks to the development of modelchecking methods for various temporal logics. The main limit of statespace exploration verification techniques is the often excessive size
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation ⋆
"... Abstract. The saturation statespace generation algorithm has demonstrated clear improvements over stateoftheart symbolic methods for asynchronous systems. This work is motivated by efficiently applying saturation to CTL model checking. First, we introduce a new “constrained saturation ” algorith ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. The saturation statespace generation algorithm has demonstrated clear improvements over stateoftheart symbolic methods for asynchronous systems. This work is motivated by efficiently applying saturation to CTL model checking. First, we introduce a new “constrained saturation
Symbolic Guided Search for CTL Model Checking
"... CTL model checking of complex systems often suffers from the stateexplosion problem. We propose using Symbolic Guided Search to avoid difficulttorepresent sections of the state space and prevent state explosion from occurring. Symbolic Guided Search applies hints to guide the exploration of the s ..."
Abstract
 Add to MetaCart
CTL model checking of complex systems often suffers from the stateexplosion problem. We propose using Symbolic Guided Search to avoid difficulttorepresent sections of the state space and prevent state explosion from occurring. Symbolic Guided Search applies hints to guide the exploration
Iterative Abstractionbased CTL Model Checking
, 2000
"... A paradigm for automatic approximation/refinement in conservative CTL model checking is presented. The approximations are used to verify a given formula conservatively by computing upper and lower bounds to the set of satisfying states at each subformula. These approximations attempt to perform con ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
A paradigm for automatic approximation/refinement in conservative CTL model checking is presented. The approximations are used to verify a given formula conservatively by computing upper and lower bounds to the set of satisfying states at each subformula. These approximations attempt to perform
Model checking the basic modalities of ctl with description logic
 Proceedings of the 2006 International Workshop on Description Logics, volume 189. CEURWS.ORG
, 2006
"... Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finitestate reactive system satisfies a temporal logic specification. Despite the fact that model checking may require analyzing the entire reachable state space of a protocol under analysis, model ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finitestate reactive system satisfies a temporal logic specification. Despite the fact that model checking may require analyzing the entire reachable state space of a protocol under analysis, model
Results 1  10
of
281