Zero, successor and equality in BDDs

Abstract We extend BDDs (binary decision diagrams) for plain propositional logic to the fragment of first order logic, consisting of quantifier free logic with zero, successor and equality. We allow equations with zero and successor in the nodes of a BDD, and call such objects ( 0 , S , = ) -BDDs. We extend the notion of Ordered BDDs in the presence of zero, successor and equality. ( 0 , S , = ) -BDDs can be transformed to equivalent Ordered ( 0 , S , = ) -BDDs by applying a number of rewrite rules until a normal form is reached. All paths in these ordered ( 0 , S , = ) -BDDs represent satisfiable conjunctions. The major advantage of transforming a formula to an equivalent Ordered ( 0 , S , = ) -BDD is that on the latter it can be observed in constant time whether the formula is a tautology, a contradiction, or just satisfiable.

[1]  Hans Zantema,et al.  Termination of Term Rewriting: Interpretation and Type Elimination , 1994, J. Symb. Comput..

[2]  Jan Friso Groote,et al.  µCRL: A Toolset for Analysing Algebraic Specifications , 2001, CAV.

[3]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[4]  David L. Dill,et al.  Validity Checking for Combinations of Theories with Equality , 1996, FMCAD.

[5]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[6]  Hai Zhou,et al.  BDD Based Procedures for a Theory of Equality with Uninterpreted Functions , 2003, Formal Methods Syst. Des..

[7]  Natarajan Shankar,et al.  PVS: Combining Specification, Proof Checking, and Model Checking , 1996, FMCAD.

[8]  Natarajan Shankar,et al.  Deconstructing Shostak , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[9]  Wang Yi,et al.  Efficient Timed Reachability Analysis Using Clock Difference Diagrams , 1998, CAV.

[10]  Amir Pnueli,et al.  Deciding Equality Formulas by Small Domains Instantiations , 1999, CAV.

[11]  Jaco van de Pol,et al.  State Space Reduction by Proving Confluence , 2002, CAV.

[12]  Hans Zantema,et al.  A rewriting approach to binary decision diagrams , 2001, J. Log. Algebraic Methods Program..

[13]  Robert E. Shostak,et al.  An algorithm for reasoning about equality , 1977, CACM.

[14]  Bahareh Badban,et al.  Two solutions to incorporate zero, successor and equality in binary decision diagrams , 2002 .

[15]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[16]  Sanjit A. Seshia,et al.  Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions , 2002, CAV.

[17]  Henrik Reif Andersen,et al.  Boolean Expression Diagrams , 2002, Inf. Comput..

[18]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[19]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[20]  Natarajan Shankar,et al.  Combining Shostak Theories , 2002, RTA.

[21]  Ofer Strichman.  On Solving Presburger and Linear Arithmetic with SAT , 2002, FMCAD.

[22]  Ofer Strichman,et al.  Deciding Separation Formulas with SAT , 2002, CAV.

[23]  Randal E. Bryant,et al.  Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic , 1999, TOCL.

[24]  Jan Willem Klop,et al.  Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[25]  Jan Friso Groote,et al.  Equational Binary Decision Diagrams , 2000, LPAR.

[26]  V. Pratt.  Two Easy Theories Whose Combination is Hard , 2002 .

[27]  Harald Ganzinger,et al.  Shostak Light , 2002, CADE.

[28]  Henrik Reif Andersen,et al.  Difference Decision Diagrams , 1999, CSL.

[29]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..