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

  • Jaco van de Pol
  • Olga Tveretina
Conference paper

DOI: 10.1007/11549345_66

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3618)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jaco van de Pol
    • 1
    • 2
  • Olga Tveretina
    • 2
  1. 1.Dept. of Software EngineeringCentrum voor Wiskunde en InformaticaAmsterdamThe Netherlands
  2. 2.Department of Computer ScienceTU EindhovenEindhovenThe Netherlands

Personalised recommendations