Construction of efficient BDDs for bounded arithmetic constraints

Authors:
Constantinos Bartzis;Tevfik Bultan
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA
Venue:
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2003

Citing 10
Cited 3

Concurrent programming: principles and practice

Concurrent programming: principles and practice
Verification of arithmetic circuits with binary moment diagrams

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Hybrid decision diagrams

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Symbolic model checking for event-driven real-time systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Composite model-checking: verification with type-specific symbolic representations

ACM Transactions on Software Engineering and Methodology (TOSEM)
Symbolic Model Checking

Symbolic Model Checking
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Model Checking Large Software Specifications

IEEE Transactions on Software Engineering
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Action Language Verifier

Proceedings of the 16th IEEE international conference on Automated software engineering

Interactive cost configuration over decision diagrams

Journal of Artificial Intelligence Research
BDDs for pseudo-boolean constraints: revisited

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
A new look at BDDs for Pseudo-Boolean constraints

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most symbolic model checkers use BDDs to represent arithmetic constraints over bounded integer variables. The size of such BDDs can be exponential on the number and size (in bits) of the integer variables in the worst case. In this paper we show how to construct linear-sized BDDs for linear integer arithmetic constraints. We present basic constructions for atomic equality and inequality constraints and extend them to handle arbitrary linear arithmetic formulas. We also present three alternative ways of handling out-of-bounds transitions, and discuss multiple bounds on integer variables. We experimentally compare our approach to other BDD-based symbolic model checkers and demonstrate that the algorithms presented in this paper can be used to improve their performance significantly.