Filters








4,828 Hits in 5.7 sec

Abstract BDDs: A Technique for Using Abstraction in Model Checking [chapter]

Edmund Clarke, Somesh Jha, Yuan Lu, Dong Wang
1999 Lecture Notes in Computer Science  
We propose a new methodology for exploiting abstraction in the context of model-checking. Our new technique uses abstract BDDs as its underlying data structure.  ...  We show that this technique builds a more refined model than traditional compiler-based methods proposed by Clarke, Grumberg and Long.  ...  In Section 2, we provide a brief overview of how abstraction is used in model checking. We also explain how abstract BDDs are constructed.  ... 
doi:10.1007/3-540-48153-2_14 fatcat:htydzv4uvvbbjccatrjysaxqsu

Abstraction and BDDs Complement SAT-Based BMC in DiVer [chapter]

Aarti Gupta, Malay Ganai, Chao Wang, Zijiang Yang, Pranav Ashar
2003 Lecture Notes in Computer Science  
The DiVer verification platform uses abstraction and BDDs to complement BMC in the quest for completeness. We demonstrate the effectiveness of our approach in practice on industrial designs.  ...  Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity for finding bugs in large designs.  ...  Given a conservative abstract model, and a correctness property, we use exact or approximate symbolic model checking techniques [3, 8] to generate the BDD constraints.  ... 
doi:10.1007/978-3-540-45069-6_20 fatcat:tckg3qn6a5ctxedw3qa5zijgk4

Tighter integration of BDDs and SMT for Predicate Abstraction

A Cimatti, A Franzen, A Griggio, K Kalyanasundaram, M Roveri
2010 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)  
Second, we propose a technique to reduce redundancy in the search by blocking already visited models.  ...  We build on a recently proposed approach that integrates BDD-based quantification techniques with SMT-based constraint solving to compute the abstraction.  ...  Predicate Abstraction [10] is one of the most widely used abstraction techniques for Model Checking within the automated Counter-Example Guided Abstraction Refinement (CEGAR) [1] framework.  ... 
doi:10.1109/date.2010.5457090 dblp:conf/date/CimattiFGKR10 fatcat:szgctjtsrvfsjnq2qozemdvype

BDD-based software verification

Dirk Beyer, Andreas Stahlbauer
2014 International Journal on Software Tools for Technology Transfer (STTT)  
In software model checking, most successful symbolic approaches use predicates as representation of the state space, and SMT solvers for computations on the state space; BDDs are often used as auxiliary  ...  (according to the variable's domain type), even in general software model checking.  ...  SMV uses a BDD-based symbolic model-checking algorithm, in which the state graph of the model is represented using BDDs.  ... 
doi:10.1007/s10009-014-0334-1 fatcat:m6xpuqjq45btrhk4lsov7i2hii

Exploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking

Gabriel P. Bischoff, Karl S. Brace, G. Cabodi, S. Nocco, S. Quer
2005 Electronical Notes in Theoretical Computer Science  
In this paper, we propose a methodology to make Binary Decision Diagrams (BDDs) and Boolean Satisfiability (SAT) Solvers cooperate.  ...  This step is carried on with a few breadth-first steps of traversal, or with what we call high-density dynamic abstraction, i.e., a new technique to collect under-approximate reachable state sets.  ...  For this reason, in the sequel we call the two inductive checks as "forward" or "backward" induction. BDD-Based Model Checking Standard BDD-based forward model checking is presented in Figure 1 .  ... 
doi:10.1016/j.entcs.2004.06.061 fatcat:fpribkbhbbfudmolfhfzj3xlzu

Incremental CTL model checking using BDD subsetting

Abelardo Pardo, Gary D. Hachtel
1998 Proceedings of the 35th annual conference on Design automation conference - DAC '98  
An automatic abstraction re nement algorithm for symbolic CTL model checking is presented.  ...  Both the re nement and the abstraction procedures are based in BDD-subsetting.  ...  Our primary objective is to explore how BDD simpli cation techniques can be used in the context of automatic abstraction for CTL model checking.  ... 
doi:10.1145/277044.277171 dblp:conf/dac/PardoH98 fatcat:uxyhutlpfrfaxbacc2e35dj7mm

BDD-Based Software Model Checking with CPAchecker [chapter]

Dirk Beyer, Andreas Stahlbauer
2013 Lecture Notes in Computer Science  
The results show that BDDs are efficient, which yields the insight that BDDs could be used selectively for some variables (to be determined by a pre-analysis), even in general software model checking.  ...  In symbolic software model checking, most approaches use predicates as symbolic representation of the state space, and SMT solvers for computations on the state space; BDDs are sometimes used as auxiliary  ...  analysis with two other approaches for symbolic software model checking.  ... 
doi:10.1007/978-3-642-36046-6_1 fatcat:ylk7othhp5ebxjsdf2atc5gclq

Scaling BDD-based Timed Verification with Simulation Reduction [chapter]

Truong Khanh Nguyen, Tian Huat Tan, Jun Sun, Jiaying Li, Yang Liu, Manman Chen, Jin Song Dong
2016 Lecture Notes in Computer Science  
Digitization is a technique that has been widely used in real-time model checking.  ...  With the assumption of digital clocks, symbolic model checking techniques (like those based on BDDs) can be applied for real-time systems.  ...  Conclusion In this paper, we propose to use the simulation relation to improve the BDD-based model checking for real-time systems. Our approach is applied to verify reachability and LTL properties.  ... 
doi:10.1007/978-3-319-47846-3_23 fatcat:5znel3pznzdorpdjk3de4shlrm

Verifying BDD Algorithms through Monadic Interpretation [chapter]

Sava Krstić, John Matthews
2002 Lecture Notes in Computer Science  
This paper describes the use of monadic interpreters to formally verify BDD algorithms at a higher level of abstraction than the original C program, but still at a concrete enough level to retain their  ...  Many symbolic model checkers use Binary Decision Diagrams (BDDs) to efficiently determine whether two Boolean formulas are semantically equivalent.  ...  Acknowledgments We thank John Launchbury and anonymous referees for useful comments on the paper.  ... 
doi:10.1007/3-540-47813-2_13 fatcat:5fbp3dsnvna53hqll4vlg2gasy

Points-to analysis using BDDs

Marc Berndl, Ondrej Lhoták, Feng Qian, Laurie Hendren, Navindra Umanee
2003 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation - PLDI '03  
In the model checking community, BDDs have been shown very effective for representing large sets and solving very large verification problems.  ...  This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs).  ...  In our work, as in model checking, we use BDDs to represent all data structures, and we show non-trivial techniques to make the original algorithm scalable to large programs using this new representation  ... 
doi:10.1145/781143.781144 fatcat:3mxylftzarbk7cl2elwr2phuve

Points-to analysis using BDDs

Marc Berndl, Ondrej Lhoták, Feng Qian, Laurie Hendren, Navindra Umanee
2003 SIGPLAN notices  
In the model checking community, BDDs have been shown very effective for representing large sets and solving very large verification problems.  ...  This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs).  ...  In our work, as in model checking, we use BDDs to represent all data structures, and we show non-trivial techniques to make the original algorithm scalable to large programs using this new representation  ... 
doi:10.1145/780822.781144 fatcat:nb64o6rhtfa7xojjltzj5xt34i

Points-to analysis using BDDs

Marc Berndl, Ondrej Lhoták, Feng Qian, Laurie Hendren, Navindra Umanee
2003 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation - PLDI '03  
In the model checking community, BDDs have been shown very effective for representing large sets and solving very large verification problems.  ...  This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs).  ...  In our work, as in model checking, we use BDDs to represent all data structures, and we show non-trivial techniques to make the original algorithm scalable to large programs using this new representation  ... 
doi:10.1145/781131.781144 dblp:conf/pldi/BerndlLQHU03 fatcat:lhd7pwpikzh33hwdb4utneijhm

Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking [chapter]

Ramesh Bharadwaj, Steve Sims
2000 Lecture Notes in Computer Science  
Salsa is an invariant checker for specifications in SAL (the SCR Abstract Language).  ...  The use of induction enables Salsa to combat the state explosion problem that plagues model checkers -it can handle specifications whose state spaces are too large for model checkers to analyze.  ...  Connie's very useful comments, her constructive criticism, and numerous suggestions for improvement greatly helped the presentation. Ralph was the first user of Salsa!  ... 
doi:10.1007/3-540-46419-0_26 fatcat:3lpcdzjt2ra47m2j5qgvra4yje

Techniques for Smaller Intermediary BDDs [chapter]

Jaco Geldenhuys, Antti Valmari
2001 Lecture Notes in Computer Science  
Binary decision diagrams (BDDs) have proven to be a powerful technique for combating the state explosion problem.  ...  They reduce the sizes of the intermediary BDDs by "rounding down" the sets they represent in such a way that the final BDD does not change.  ...  Symbolic model checking [8] is an advanced application of this idea.  ... 
doi:10.1007/3-540-44685-0_16 fatcat:brkqsnbkrfa47kj6e6ller5you

Generating BDD models for process algebra terms [chapter]

Ashvin Dsouza, Bard Bloom
1995 Lecture Notes in Computer Science  
Model checking using such BDDs can often significantly speedup the testing of properties such as bisimilarity over direct algorithms.  ...  We also introduce a useful extension of Simple providing explicit recursion.  ...  That is, BDD techniques indeed help model-checking for CCS. Other researchers have used BDD techniques on CCS and related process algebras.  ... 
doi:10.1007/3-540-60045-0_37 fatcat:heb7i45tofh7zjd7idopq3ftky
« Previous Showing results 1 — 15 out of 4,828 results