Jan Friso Groote, Jaco van de Pol  Home/Search
Context Related
| cwi.nl/~vdpol/papers/eqbdds.ps.Z Cached: 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.
PS.gz PS Image Update HelpFrom: cwi.nl/~vdpol/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of ordered EQ-BDDs (EQ-OBDD) is defined, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQ-OBDDs satisfiability and tautology checking can be done in constant time. Several procedures to eliminate equality from BDDs have been reported in the literature. Typical for our approach is that we keep equalities, and as a consequence... (Update)
Context of citations to this paper: More
...propositional logic. In the last approach that we mention, called the EQ BDD method (Binary Decision Diagrams extended with Equality [16]) boolean and arithmetic reasoning are not separated, but intertwined. Similar to the BDD approach, an ordered EQ BDD is built, but during...
...functions, the problem is usually rst reduced to propositional logic. A BDD of the result is then built to check for validity [13]. There were several attempts to extend the expressive power of BDDs towards quanti er free rst order logic with equality. Goel et al. 9]...
Cited by: More
Analysing the BKE-security protocol with μCRL - Groote, Mauw, Serebrenik (Correct)
Parameterised Boolean Equation Systems - Groote, Willemse (2004) (Correct)
Transforming Equality Logic to Propositional Logic - Zantema, Groote (Correct)
Active bibliography (related documents): More All
0.5: Equational Binary Decision Diagrams - Groote, Pol (2000) (Correct)
0.1: Two Solutions to Incorporate Zero, Successor and Equality in.. - Badban, Pol (2002) (Correct)
0.0: Deciding Propositional Combinations of Equalities.. - Filliâtre.. (Correct)
Similar documents based on text: More All
0.5: Verifying a Sliding Window Protocol in μCRL - Fokkink, Groote, Pang, Badban, .. (2003) (Correct)
0.4: Binary Decision Diagrams by Shared Rewriting - Pol, Zantema (2000) (Correct)
0.3: JITty: a rewriter with strategy annotations - Pol (Correct)
Related documents from co-citation: More All
5: BDD based procedures for a theory of equality with uninterpreted functions - Sajid, Goel et al.
5: Modeling and verifying systems using a logic of counter arithmetic with lambda e.. - Bryant, Lahiri et al.
4: Deciding separation formulas with SAT - Strichman, Seshia et al. - 2002
BibTeX entry: (Update)
Groote, J., and van de Pol, J. Equational binary decision diagrams. Tech. rep. SEN-R0006, CWI, Amsterdam, 2000. Available via http://www.cwi.nl/vdpol/papers/eqbdds.ps.Z. http://citeseer.ist.psu.edu/article/groote00equational.html More
@inproceedings{ groote00equational,
author = "Jan Friso Groote and Jaco van de Pol",
title = "Equational Binary Decision Diagrams",
booktitle = "Logic Programming and Automated Reasoning",
pages = "161-178",
year = "2000",
url = "citeseer.ist.psu.edu/article/groote00equational.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986
510 Symbolic boolean manipulation with ordered binary-decision d.. - Bryant - 1992
474 Term rewriting systems - Klop - 1991
407 Introduction to the ISO specification language LOTOS (context) - Bolognesi, Brinksma - 1987
353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
134 PVS: Combining specification (context) - Owre, Rajan et al. - 1996
100 Automatic verification of pipelined microprocessors control - Burch, Dill - 1994
67 The syntax and semantics of CRL - Groote, Ponse - 1994
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
37 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
32 Boolean expression diagrams - Andersen, Hulgaard - 1997
25 Processor verification using efficient reductions of the log.. - Bryant, German et al. - 1999
24 Studies in Logic and the Foundations of Mathematics (context) - Ackermann, of et al. - 1954
23 Algorithms and Data Structures in VLSI Design: OBDD-Foundati.. (context) - Meinel, Theobald - 1998
2 semantics and theory of programming (context) - Groote, Sellink et al. - 1996
2 Benchmarks for satisfiability checking of equality formulas (context) - Shtrichman - 1999
1 Paper and software accessible via http://www (context) - van den Brand, de Jong et al.
1 Exploiting prositive equality in a logic of equality with un.. (context) - Bryant, German et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cwi.nl/~vdpol/papers): More
Modularity in Many-sorted Term Rewriting Systems - Pol (1993) (Correct)
A Bounded Retransmission Protocol for Large Data Packets. A .. - Groote, van der Pol (1993) (Correct)
Operational Semantics of Rewriting with Priorities - Pol (1997) (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