Results 1  10
of
2,286,781
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: 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 753 (40 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
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
Symbolic model checking of software
 Electr. Notes Theor. Comput. Sci
"... In hardware verification, the introduction of symbolic model checking has been considered a breakthrough, allowing to verify systems clearly outofreach of any explicitstate model checker. In contrast, in the verification of concurrent software, model checking is still predominantly performed by ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
In hardware verification, the introduction of symbolic model checking has been considered a breakthrough, allowing to verify systems clearly outofreach of any explicitstate model checker. In contrast, in the verification of concurrent software, model checking is still predominantly performed
⊕OBDD in Symbolic Model Checking ⋆
"... Abstract. We present a feasibility study of using ⊕OBDD data structure in symbolic model checking (SMC). ⊕OBDD has been proposed as a more succinct modification of well known OBDD data structure which is of common use in nowadays SMC. We introduce three modifications of ⊕OBDD, analyze their respe ..."
Abstract
 Add to MetaCart
Abstract. We present a feasibility study of using ⊕OBDD data structure in symbolic model checking (SMC). ⊕OBDD has been proposed as a more succinct modification of well known OBDD data structure which is of common use in nowadays SMC. We introduce three modifications of ⊕OBDD, analyze
Symbolic Model Checking
"... Model checking is a popular formal verification technique for both software and hardware. The verification of concurrent software predominantly employs explicitstate model checkers, such as Spin, that use partialorder reduction as a main technique to deal with large state spaces efficiently. In the ..."
Abstract
 Add to MetaCart
. In the hardware domain, the introduction of symbolic model checking has been considered a breakthrough, allowing the verification of systems clearly outofreach of any explicitstate model checker. This paper introduces ImProviso, a new algorithm for model checking of software that efficiently combines
Techniques in Symbolic Model Checking
 IIT BOMBAY
, 2003
"... ï»¿Model checking is a highly automatic verification technique for finite state concurrent systems. In this approach for verification, temporal specifications are exhaustively verified over the statespace of the concurrent system. The number of states grows exponentially with the concurrency of th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of the system and that makes explicit statespace enumeration based techniques inefficient.This phenomenon is called state space explosion. One of the possible ways to overcome this limitation is to avoid explicit enumeration of the state space. These approaches, commonly known as Symbolic Model Checking, uses
Flat acceleration in symbolic model checking
 IN ATVA’05, VOLUME 3707 OF LNCS
, 2005
"... Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. Socalled “acceleration techniques” enhance the convergence of fixpoint computations by computing the transitive closure of some transitions. In this paper we develop a ..."
Abstract

Cited by 32 (15 self)
 Add to MetaCart
Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. Socalled “acceleration techniques” enhance the convergence of fixpoint computations by computing the transitive closure of some transitions. In this paper we develop a
Distributed Symbolic Model Checking for
"... Abstract In this paper we propose a distributed symbolic algorithm for modelchecking of propositional _calculus formulas. _calculus is a powerful formalism and many problems like (fair) CTL and LTL model checking can be solved using the _calculus model checking. Previous works on distributedsymb ..."
Abstract
 Add to MetaCart
Abstract In this paper we propose a distributed symbolic algorithm for modelchecking of propositional _calculus formulas. _calculus is a powerful formalism and many problems like (fair) CTL and LTL model checking can be solved using the _calculus model checking. Previous works
Symbolic model checking for probabilistic processes
 IN PROCEEDINGS OF ICALP '97
, 1997
"... We introduce a symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as models. Model checking for probabilistic logics typically involves solving linear equation systems in order to ascertain the probability of a given formula holding in a stat ..."
Abstract

Cited by 97 (29 self)
 Add to MetaCart
We introduce a symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as models. Model checking for probabilistic logics typically involves solving linear equation systems in order to ascertain the probability of a given formula holding in a
Results 1  10
of
2,286,781