Skip to main content
SpringerLink
Log in

A BDD-Representation for the Logic of Equality and Uninterpreted Functions

  • Conference paper
Mathematical Foundations of Computer Science 2005 (MFCS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3618))

Abstract

The logic of equality and uninterpreted functions (EUF) has been proposed for processor verification. This paper presents a new data structure called Binary Decision Diagrams for representing EUF formulas (EUF-BDDs). We define EUF-BDDs similar to BDDs, but we allow equalities between terms as labels instead of Boolean variables. We provide an approach to build a reduced ordered EUF-BDD (EUF-ROBDD) and prove that every path to a leaf is satisfiable by construction. Moreover, EUF-ROBDDs are logically equivalent representations of EUF-formulae, so they can also be used to represent state spaces in symbolic model checking with data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bryant, R.: Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24, 293–318 (1992)

    Article  Google Scholar 

  2. Burch, J., Dill, D.: Automated verification of pipelined microprocesoor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 68–80. Springer, Heidelberg (1994)

    Google Scholar 

  3. Pnueli, A., Rodeh, Y., Shtrichman, O., Siegel, M.: The small model property: how small can it be? Information and Computation 178, 279–293 (2002)

    MATH  MathSciNet  Google Scholar 

  4. Nelson, G., Oppen, D.: Fast decision procedures based on congruence closure. Journal of the ACM 27(2), 356–364 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  5. Shostak, R.: An algorithm for reasoning about equality. Communications of the ACM 21, 583–585 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ackermann, W.: Solvable cases of the decision problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1954)

    MATH  Google Scholar 

  7. Goel, A., Sajid, K., Zhou, H., Aziz, A., Singhal, V.: BDD based procedures for a theory of equality with uninterpreted functions. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 244–255. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Fontaine, P., Gribomont, E.P.: Using BDDs with combinations of theories. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol. 2514, pp. 190–201. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Bryant, R., Velev, M.: Boolean satisfiability with transitivity constraints. ACM Transactions on Computational Logic 3, 604–627 (2002)

    Article  MathSciNet  Google Scholar 

  10. Tveretina, O., Zantema, H.: A proof system and a decision procedure for equality logic. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 530–539. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Groote, J., van de Pol, J.: Equational binary decision diagrams. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol. 1955, pp. 161–178. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Badban, B., van de Pol, J.: Zero, sucessor and equality in BDDs. Annals of Pure and Applied Logic 133/1-3, 101–123 (2005)

    Article  Google Scholar 

  13. Badban, B., van de Pol, J.: An algorithm to verify formulas by means of (0,s,=)-BDDs. In: Proceedings of the 9th Annual Computer Society of Iran Computer Conference (CSICC 2004), Tehran, Iran (2004)

    Google Scholar 

  14. Blom, S., Groote, J., van Langevelde, I., Lisser, B., van de Pol, J.: New developments around the μCRL tool set. In: Proceedings of FMICS 2003. ENTCS, vol. 80 (2003)

    Google Scholar 

  15. Groote, J., Willemse, T.: Parameterised boolean equation systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 308–324. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  17. van de Pol, J., Tveretina, O.: A BDD-representation for the logic of equality and uninterpreted functions (a full version with proofs). Technical Report SEN-R0509, Centrum voor Wiskunde en Informatica, Amsterdam (2005)

    Google Scholar 

  18. Tveretina, O.: A decision procedure for equality logic with uninterpreted functions. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 66–79. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Blom, S., van de Pol, J.: State space reduction by proving confluence. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 596–609. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. van de Pol, J.: A prover for the μCRL toolset with applications – Version 0.1. Technical Report SEN-R0106, CWI, Amsterdam (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Software Engineering, Centrum voor Wiskunde en Informatica, P.O.-Box 94.079, 1090 GB, Amsterdam, The Netherlands

    Jaco van de Pol

  2. Department of Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jaco van de Pol & Olga Tveretina

Authors
  1. Jaco van de Pol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olga Tveretina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Gdansk University, Wita Stwosza 57, 80 952, Gdansk, Poland

    Joanna Jȩdrzejowicz  & Andrzej Szepietowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van de Pol, J., Tveretina, O. (2005). A BDD-Representation for the Logic of Equality and Uninterpreted Functions. In: JÈ©drzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_66

Download citation

  • DOI: https://doi.org/10.1007/11549345_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28702-5

  • Online ISBN: 978-3-540-31867-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation