Filters








4,813 Hits in 2.6 sec

Symbolic Model Checking without BDDs [chapter]

Armin Biere, Alessandro Cimatti, Edmund Clarke, Yunshan Zhu
1999 Lecture Notes in Computer Science  
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.  ...  We show that bounded LTL model checking can be done without a tableau construction. We have implemented a model checker BMC, based on bounded model checking, and preliminary results are presented. ?  ...  Experimental Results We have implemented a model checker BMC based on bounded model checking. Its input language is a subset of the SMV language [14] .  ... 
doi:10.1007/3-540-49059-0_14 fatcat:gmqrogonfjgnlouuklzk37mk74

Verifying Safety Properties of a PowerPC− Microprocessor Using Symbolic Model Checking without BDDs [chapter]

Armin Biere, Edmund Clarke, Richard Raimi, Yunshan Zhu
1999 Lecture Notes in Computer Science  
In [1] Bounded Model Checking with the aid of satisfiability solving (SAT) was introduced as an alternative to symbolic model checking with BDDs.  ...  Based on that experience, we propose a verification methodology that we feel can bring model checking into the mainstream of industrial chip design.  ...  In [1] , it was shown that this new technique sometimes performed much better than BDD based symbolic model checking.  ... 
doi:10.1007/3-540-48683-6_8 fatcat:uuljdrnw6val3gj6rmzd6mawba

Symbolic Model Checking without BDDs

Armin Biere, Alessandro Cimatti, Edmund M Clarke, Yunshan Zhu
2018
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.  ...  We introduce a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.We show that bounded LTL model checking can be done without a tableau construction.  ...  Experimental Results We have implemented a model checker BMC based on bounded model checking. Its input language is a subset of the SMV language [14] .  ... 
doi:10.1184/r1/6610115 fatcat:p6ojqk7jcjaizakq7bb6jpwnvm

BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems [chapter]

Tevfik Bultan
2000 Lecture Notes in Computer Science  
BDD-based symbolic model checking has been successful in verification of a wide range of systems.  ...  Recently, constraint-based approaches, which use arithmetic constraints as a symbolic representation, have been used in symbolic model checking of infinite-state systems.  ...  We first discuss other related approaches to symbolic model checking in Sect. 2. In Sect. 3, we give a brief overview of symbolic model checking.  ... 
doi:10.1007/3-540-46419-0_30 fatcat:gv2kvu54ovhrlphws7n2sstnaq

Formal Methods for Functional Verification [chapter]

Randal E. Bryant, James H. Kukula
2003 The Best of ICCAD  
For example, with symbolic model checking BDDs are used to represent the system being modeled, and the sets of possible states of the system.  ...  The major breakthrough for the application of model checking to hardware design came with the advent of symbolic model checking, where both the circuit model and the set of reachables states are encoded  ... 
doi:10.1007/978-1-4615-0292-0_1 fatcat:t776pq6t7reyffs327dkmonjse

Symbolic assume-guarantee reasoning through BDD learning

Fei He, Bow-Yaw Wang, Liangze Yin, Lei Zhu
2014 Proceedings of the 36th International Conference on Software Engineering - ICSE 2014  
Symbolic model checking explores many states simultaneously and reports numerous erroneous traces.  ...  Both symbolic model checking and assume-guarantee reasoning aim to circumvent the state explosion problem.  ...  Rather than BDD-based symbolic model checking, both works [12, 11] employ a SAT-based symbolic model checker.  ... 
doi:10.1145/2568225.2568253 dblp:conf/icse/HeWYZ14 fatcat:hcvn4x3wyzd6xmyas6bonlve7u

Improving BDD Based Symbolic Model Checking with Isomorphism Exploiting Transition Relations

Christian Appold
2011 Electronic Proceedings in Theoretical Computer Science  
Symbolic model checking by using BDDs has greatly improved the applicability of model checking. Nevertheless, BDD based symbolic model checking can still be very memory and time consuming.  ...  In this paper we target the symbolic verification of asynchronous concurrent systems.  ...  A very effective model checking technique is symbolic model checking [8] , [12] based on Binary Decision Diagrams (BDDs) [3] .  ... 
doi:10.4204/eptcs.54.2 fatcat:rveusqlvszh3xml4hxrbf7fwnu

An Optimized Symbolic Bounded Model Checking Engine [chapter]

Rachel Tzoref, Mark Matusevich, Eli Berger, Ilan Beer
2003 Lecture Notes in Computer Science  
We present an optimized bounded model checker based on BDDs and describe the advantages and drawbacks of this model checker as compared to BDD-based symbolic model checking and SAT-based model checking  ...  It has been shown that bounded model checking using a SAT solver can solve many verification problems that would cause BDD based symbolic model checking engines to explode.  ...  As a result, the BDD-based BMC is only sensitive to the amount of nondeterminism in the model. In contrast, symbolic model checking and SAT solvers represent the states by state variables.  ... 
doi:10.1007/978-3-540-39724-3_13 fatcat:m7b4a35spjbrbmh7urbpetofr4

A Comparative Study of BDD Packages for Probabilistic Symbolic Model Checking [chapter]

Tom van Dijk, Ernst Moritz Hahn, David N. Jansen, Yong Li, Thomas Neele, Mariëlle Stoelinga, Andrea Turrini, Lijun Zhang
2015 Lecture Notes in Computer Science  
While various BDD and MTBDD packages have been developed in the community, the CUDD package remains the default choice of most of the symbolic (probabilistic) model checkers.  ...  Symbolic data structures using Binary Decision Diagrams (BDDs) have been successfully used in the last decades to analyse large systems.  ...  BDD-Based Probabilistic Symbolic Model Checking In this section, we recall BDDs and MTBDDs. Then, we briefly discuss symbolic model checking using BDDs.  ... 
doi:10.1007/978-3-319-25942-0_3 fatcat:jtfcnc2qwfdzbebwvfol5mkjbe

A model checking framework for hierarchical systems

Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong
2011 2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)  
Model Checking Symbolic Encoding ...  ...  Most importantly, it supports two different model checking techniques, i.e., explicit model checking and symbolic model checking.  ... 
doi:10.1109/ase.2011.6100143 dblp:conf/kbse/NguyenSLD11 fatcat:ixrgmmbqsrasfmtjyer4o57ofu

Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling

Florian Pigorsch, Christoph Scholl, Stefan Disch
2006 2006 Formal Methods in Computer Aided Design  
For several examples, our method outperforms BDD based symbolic model checking by orders of magnitude.  ...  In contrast to the majority of verification methods presented in recent years, we support unbounded model checking based on symbolic representations of characteristic functions.  ...  For several examples, our method outperforms BDD based symbolic model checking by orders of magnitude.  ... 
doi:10.1109/fmcad.2006.4 dblp:conf/fmcad/PigorschSD06 fatcat:i7kh5n3ojndu3cobgyzfcekch4

Abstraction-Guided Model Checking Using Symbolic IDA* and Heuristic Synthesis [chapter]

Kairong Qian, Albert Nymeyer, Steven Susanto
2005 Lecture Notes in Computer Science  
A heuristic-based symbolic model checking algorithm, BDD-IDA * that efficiently falsifies invariant properties of a system is presented.  ...  As in bounded model checking, the algorithm uses an iterative deepening search strategy.  ...  Invariant checking in symbolic model checking is usually done by either BDD-based or SAT-based algorithms.  ... 
doi:10.1007/11562436_21 fatcat:o6f2ab6zhjgsbeqsnp3bornm2a

Sylvan: Multi-Core Decision Diagrams [chapter]

Tom van Dijk, Jaco van de Pol
2015 Lecture Notes in Computer Science  
Decision diagrams such as binary decision diagrams and multivalued decision diagrams play an important role in various fields, including symbolic model checking.  ...  We also demonstrate that the parallelization of symbolic model checking for explicit-state modeling languages with an on-the-fly next-state function, as supported by LTSmin, scales well.  ...  The reachability algorithm for symbolic model checking using BDD operations is given in Fig. 2 .  ... 
doi:10.1007/978-3-662-46681-0_60 fatcat:47svdkgo75bgld46bk57lanngy

Using induction and BDDs to model check invariants [chapter]

David Déharbe, Anamaria Martins Moreira
1997 IFIP Advances in Information and Communication Technology  
We show how this characterization can be computed by means of BDD-based operations, without performing a fixpoint iteration over sets of states as the CTL symbolic model checking algorithm does.  ...  Representing characteristic functions with BDDs, it is possible to decide whether this condition holds with the conventional symbolic model checking algorithm.  ...  This test for validity seems to compare advantageously to conventional symbolic model checking techniques.  ... 
doi:10.1007/978-0-387-35190-2_13 fatcat:pmb4ja7zibcndjpmhtmidmlzj4

Can American Checkers be Solved by Means of Symbolic Model Checking?

Michael Baldamus, Klaus Schneider, Michael Wenz, Roberto Ziller
2001 Electronical Notes in Theoretical Computer Science  
Symbolic model checking has become a successful technique for verifying large finite state systems up to more than 10 20 states.  ...  Some board games like American checkers have a state space whose size is well within the range of state space sizes that have been tackled by symbolic model checking.  ...  A successful approach is known as symbolic model checking.  ... 
doi:10.1016/s1571-0661(04)80892-2 fatcat:hjrc3zt3vvbjreoagsnhnk2doe
« Previous Showing results 1 — 15 out of 4,813 results