Bahareh Badban, Jaco van de Pol  Home/Search
Context
Related
| cwi.nl/~vdpol/pape...osbdds_report.ps.Z 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: homepages.cwi.nl/~vdpol/papers... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this article we extend BDDs (binary decision diagrams) for plain propositional logic to the fragment of first order logic, consisting of quantifier free logic with equality, zero and successor. We insert equations with zero and successor in BDDs, and call these objects (0, S, =)-BDDs. We extend the notion of Ordered BDDs in the presence of equality, zero and successor. (0, S, =)-BDDs can be transformed to equivalent Ordered (0, S, =)-BDDs by applying a number of rewrite rules. All paths in... (Update)
Active bibliography (related documents): More All
2.7: Two Solutions to Incorporate Zero, Successor and Equality in.. - Badban, Pol (2002) (Correct)
0.3: Analysing the BKE-security protocol with μCRL - Groote, Mauw, Serebrenik (Correct)
0.3: μCRL: A Toolset for Analysing Algebraic Specifications - Blom, Fokkink, Groote.. (2001) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.4: Verifying a Sliding Window Protocol in μCRL - Fokkink, Groote, Pang, Badban, .. (2003) (Correct)
0.2: Equational Binary Decision Diagrams - Groote, Pol (2000) (Correct)
0.2: State Space Reduction Using Partial τ-Confluence - Groote, al. (2000) (Correct)
BibTeX entry: (Update)
@misc{ badban-two,
author = "Bahareh Badban and Jaco van de Pol",
title = "Two Solutions to Incorporate Zero, Successor and Equality in Binary Decision
Diagrams",
url = "citeseer.ist.psu.edu/601398.html" }
Citations (may not include all citations):510 Symbolic boolean manipulation with ordered binary-decision d.. - Bryant - 1992
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
172 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
134 PVS: Combining specification (context) - Owre, Rajan et al. - 1996
111 Fast decision procedures based on congruence closure (context) - Nelson, Oppen - 1980
100 Automatic verification of pipelined microprocessors control - Burch, Dill - 1994
94 Validity checking for combinations of theories with equality - Barrett, Dill et al. - 1996
93 UPPAAL: a tool suite for the automatic verification of real-.. - Bengtsson, Larsen et al. - 1996
48 Deciding equality formulas by small domains instantiations - Pnueli, Rodeh et al. - 1999
47 BDD based procedures for a theory of equality with uninterpr.. - Goel, Sajid et al. - 1998
42 Modeling and verifying systems using a logic of counter arit.. - Seshia, Lahiri et al. - 2002
41 An algorithm for reasoning about equality (context) - Shostak - 1978
32 Boolean expression diagrams - Andersen, Hulgaard - 1997
26 Two easy theories whose combination is hard - Pratt - 1970
24 Studies in Logic and the Foundations of Mathematics (context) - Ackermann, of et al. - 1954
21 Deciding separation formulas with SAT - Strichman, Seshia et al. - 2002
18 Combining Shostak theories - Shankar, Rue - 2002
18 CRL: A toolset for analysing algebraic specifications - Blom, Fokkink et al. - 2001
16 erence decision diagrams (context) - Mller, Lichtenberg et al. - 1999
14 cient timed reachability analysis using clock di#erence diag.. (context) - Behrmann, Larsen et al. - 1999
14 Implementation of Fourier-Motzkin elimination - Bik, Wijsho - 1994
13 Equational binary decision diagrams - Groote, Pol - 2000
12 Shostak light - Ganzinger - 2002
9 Deconstructing Shostak (context) - Ruess, Shankar - 2001
8 Processor verification using e#cient reductions of the logic.. (context) - Bryant, German et al. - 2001
5 State space reduction by proving confluence (context) - Blom, Pol - 2002
4 A prover for the CRL toolset with applications -- Version - Pol - 2001
4 Termination of term rewriting - Zantema - 2003
2 A rewriting approach to binary decision diagrams (context) - Zantema, Pol - 2001
2 On solving Presburger and linear arithmetic with SAT - Strichman - 2002
Documents on the same site (http://homepages.cwi.nl/~vdpol/papers/): More
Formal specification of JavaSpaces™ architectures using.. - Pol, Espada (Correct)
JITty: a rewriter with strategy annotations - Pol (Correct)
μCRL specification of event notification in JavaSpaces™? - Pol, Espada (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