Tevfik Bultan  Home/Search
Context
Related
| ucsb.edu/~bultan/publicati...tacas00.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsb.edu/~bultan/p...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 argue that use of constraint-based model checking is not limited to infinite-state systems. It can also be used as an alternative to BDDbased model checking for systems with integer variables which have finite but large... (Update)
Similar documents (at the sentence level):
14.6%: Composite Model Checking: Verification with Type-Specific .. - Bultan, Gerber, League (2000) (Correct)
Active bibliography (related documents): More All
0.5: Specification and Verification of Temporal Information Using.. - Amon, Borriello (1998) (Correct)
0.1: A Comparison of Presburger Engines for EFSM Reachability - Shiple, Kukula, Ranjan (1998) (Correct)
0.1: Tools and Techniques for Verifying Parameterized Systems - Shahar (2001) (Correct)
Similar documents based on text: More All
0.8: Construction of efficient BDDs for Bounded Arithmetic.. - Bartzis, Bultan (Correct)
0.5: Efficient Symbolic Representations for Arithmetic Constraints .. - Bartzis, Bultan (2003) (Correct)
0.4: A Composite Model Checking Toolset for Analyzing Software.. - Tevfik Bultan Department (Correct)
BibTeX entry: (Update)
@misc{ bultan-bdd,
author = "Tevfik Bultan",
title = "{BDD} vs. Constraint-Based Model Checking: An Experimental Evaluation for
Asynchronous Concurrent Systems",
url = "citeseer.ist.psu.edu/380160.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1990
603 Kluwer Academic Publishers (context) - McMillan, checking - 1993
231 Model checking and abstraction - Clarke, Grumberg et al. - 1992
167 Automatic symbolic verification of embedded systems - Alur, Henzinger et al. - 1996
88 Model checking in CLP - Delzanno, Podelski - 1999
83 Model checking large software specifications - Chan, Anderson et al. - 1998
79 Symbolic model checking with partitioned transition relation.. - Burch, Clarke et al. - 1991
73 Symbolic model checking with rich assertional languages - Kesten, Maler et al. - 1997
52 The Omega library interface guide (context) - Kelly, Maslov et al. - 1995
48 Using abstraction and model checking to detect safety violat.. (context) - Heitmeyer, Kirby et al. - 1998
47 Model-checking concurrent systems with unbounded integer var.. - Bultan, Gerber et al. - 1999
40 Cummings Publishing Company (context) - Andrews, Principles et al. - 1991
38 Symbolic model checking of infinite state systems using Pres.. - Bultan, Gerber et al. - 1997
30 A comparison of Presburger engines for EFSM reachability - Shiple, Kukula et al. - 1998
28 An automata-theoretic approach to Presburger arithmetic cons.. - Wolper, Boigelot - 1995
26 Word level symbolic model checking: A new approach for verif.. (context) - Clarke, Zhao - 1995
21 Verifying systems with integer constraints and boolean predi.. - Bultan, Gerber et al. - 1998
20 Symbolic model checking for eventdriven real-time systems (context) - Yang, Mok et al. - 1997
9 Mona: Decidable arithmetic in practice - Biehl, Klarlund et al. - 1996
2 Implicit state enumeration for FSMs with datapaths - Kukula, Shiple et al. - 1998
Documents on the same site (http://www.cs.ucsb.edu/~bultan/publications/publications.html): More
A Fast Neural-Network Algorithm for Cell Placement - Aykanat, Bultan, Haritaoglu (Correct)
Model Checking Concurrent Systems with Unbounded Integer.. - Bultan, Gerber, Pugh (1998) (Correct)
Circuit Partitioning Using Mean Field Annealing - Bultan, Aykanat (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC