See this document in CiteSeerX!

A Library for Composite Symbolic Representations  (Make Corrections)  
Tuba Yavuz-Kahveci, Murat Tuncer, Tevfik Bultan
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
ucsb.edu/~bultan/publicat...tacas01b.ps
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  ucsb.edu/~bultan/p...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: . In this paper, we present the design and the implementation of a composite model checking library. Our tool combines different symbolic representations, such as BDDs for representing boolean logic formulas and polyhedral representations for linear arithmetic formulas, with a single interface. Based on this common interface, these data structures are combined using what we call a composite representation. We used an object-oriented design to implement the composite symbolic library. We... (Update)

Similar documents based on text:   More   All
2.2:   A Symbolic Manipulator for Automated Verification of.. - Yavuz-Kahveci, Bultan   (Correct)
0.7:   Construction of efficient BDDs for Bounded Arithmetic.. - Bartzis, Bultan   (Correct)
0.5:   Efficient Symbolic Representations for Arithmetic Constraints .. - Bartzis, Bultan (2002)   (Correct)

BibTeX entry:   (Update)

@article{ yavuzkahveci01library,
    author = "Tuba Yavuz-Kahveci and Murat Tuncer and Tevfik Bultan",
    title = "A Library for Composite Symbolic Representations",
    journal = "Lecture Notes in Computer Science",
    volume = "2031",
    pages = "52--??",
    year = "2001",
    url = "citeseer.ist.psu.edu/402436.html" }
Citations (may not include all citations):
2157   Design Patterns: Elements of Reusable Object-Oriented Softwa.. (context) - Gamma, Helm et al. - 1994
1726   Graph-based algorithms for boolean function manipulation - Bryant - 1986
779   Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1990
603   Kluwer Academic Publishers (context) - McMillan, checking - 1993
399   The algorithmic analysis of hybrid systems - Alur, Courcoubetis et al. - 1995
167   Automatic symbolic verification of embedded systems - Alur, Henzinger et al. - 1996
98   State-based model checking of event-driven system requiremen.. - Atlee, Gannon - 1993
75   Verification of linear hybrid systems by means of convex app.. - Halbwachs, Raymond et al. - 1994
52   The Omega library interface guide (context) - Kelly, Maslov et al. - 1995
47   Model-checking concurrent systems with unbounded integer var.. - Bultan, Gerber et al. - 1999
38   Symbolic model checking of infinite state systems using Pres.. - Bultan, Gerber et al. - 1997
30   An overview of SAL - Bensalem, Ganesh et al. - 2000
21   Verifying systems with integer constraints and boolean predi.. - Bultan, Gerber et al. - 1998
19   A logic-model semantics for SCR software requirements - Atlee, Buckley - 1996
16   Composite model checking: Verification with type-specific sy.. - Bultan, Gerber et al. - 2000

[Article contains additional citations not shown here]

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