Results 1  10
of
896
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
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
Automatic predicate abstraction of C programs
 IN PROC. ACM PLDI
, 2001
"... Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, statespace explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems. Recently, there has been significant in ..."
Abstract

Cited by 488 (33 self)
 Add to MetaCart
Model checking has been widely successful in validating and debugging designs in the hardware and protocol domains. However, statespace explosion limits the applicability of model checking tools, so model checkers typically operate on abstractions of systems. Recently, there has been significant
An Improvement of McMillan's Unfolding Algorithm
 Formal Methods in System Design
, 1996
"... McMillan has recently proposed a new technique to avoid the state explosion problem in the verification of systems modelled with finitestate Petri nets. The technique requires to construct a finite initial part of the unfolding of the net. McMillan's algorithm for this task may yield initial p ..."
Abstract

Cited by 212 (9 self)
 Add to MetaCart
McMillan has recently proposed a new technique to avoid the state explosion problem in the verification of systems modelled with finitestate Petri nets. The technique requires to construct a finite initial part of the unfolding of the net. McMillan's algorithm for this task may yield initial
Techniques to Tackle State Explosion in Global Predicate Detection
 IEEE Transactions on Software Engineering
, 2001
"... AbstractÐGlobal predicate detection, which is an important problem in testing and debugging distributed programs, is very hard due to the combinatorial explosion of the global state space. This paper presents several techniques to tackle the state explosion problem in detecting whether an arbitrary ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
AbstractÐGlobal predicate detection, which is an important problem in testing and debugging distributed programs, is very hard due to the combinatorial explosion of the global state space. This paper presents several techniques to tackle the state explosion problem in detecting whether an arbitrary
Efficient Verification of Timed Automata using Dense and Discrete Time Semantics
"... In this paper we argue that the semantic issues of discrete vs. dense time should be separated as much as possible from the pragmatics of statespace representation. Contrary to some misconceptions, the discrete semantics is not inherently bound to use stateexplosive techniques any more than the de ..."
Abstract

Cited by 27 (5 self)
 Add to MetaCart
In this paper we argue that the semantic issues of discrete vs. dense time should be separated as much as possible from the pragmatics of statespace representation. Contrary to some misconceptions, the discrete semantics is not inherently bound to use stateexplosive techniques any more than
Iterative Context Bounding for Systematic Testing of Multithreaded Programs
, 2007
"... Multithreaded programs are difficult to get right because of unexpected interaction between concurrently executing threads. Traditional testing methods are inadequate for catching subtle concurrency errors which manifest themselves late in the development cycle and postdeployment. Model checking or ..."
Abstract

Cited by 181 (17 self)
 Add to MetaCart
or systematic exploration of program behavior is a promising alternative to traditional testing methods. However, it is difficult to perform systematic search on large programs as the number of possible program behaviors grows exponentially with the program size. Confronted with this stateexplosion problem
All from one, one for all: on model checking using representatives
 LNCS
, 1993
"... Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences, based ..."
Abstract

Cited by 184 (6 self)
 Add to MetaCart
Checking that a given finite state program satisfies a linear temporal logic property is suffering in many cases from a severe space and time explosion. One way to cope with this is to reduce the state graph used for model checking. We define an equivalence relation between infinite sequences
Model Checking and the State Explosion Problem
"... Model checking is an automatic verification technique for concurrent systems that are finite state or have finite state abstractions. It has been used successfully to verify computer hardware, and it is beginning to be used to verify computer software as well. As the number of state variables in t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
in the system increases, the size of the system state space grows exponentially. This is called the “state explosion problem”. Much of the research in model checking over the past 30 years has involved developing techniques for dealing with this problem. In these lecture notes, we will explain how the basic
Linear Temporal Logic: Expressiveness and Model Checking
, 2004
"... Model checking of finitestate systems with specifications given as formulae of Linear Temporal Logic (LTL) is one of the most common verification problems. Like other verification problems, LTL model checking suffers from state explosion. Techniques tackling state explosion usually employ some spec ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Model checking of finitestate systems with specifications given as formulae of Linear Temporal Logic (LTL) is one of the most common verification problems. Like other verification problems, LTL model checking suffers from state explosion. Techniques tackling state explosion usually employ some
Progress on the State Explosion Problem in Model Checking
, 2000
"... Model checking is an automatic verification technique for finite state concurrent systems. In this approach to verification, temporal logic specifications are checked by an exhaustive search of the state space of the concurrent system. Since the size of the state space grows exponentially with th ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
with the number of processes, model checking techniques based on explicit state enumeration can only handle relatively small examples. This phenomenon is commonly called the "State Explosion Problem". Over the past ten years considerable progress has been made on this problem by (1) representing
Results 1  10
of
896