A Term Rewriting Technique for Decision Graphs

Authors:
Bahareh Badban
Affiliations:
Department of Software Engineering, University of Konstanz, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 9
Cited 0

Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Symbolic model checking: an approach to the state explosion problem

Symbolic model checking: an approach to the state explosion problem
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure

Journal of the ACM (JACM)
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic

ACM Transactions on Computational Logic (TOCL)
BDD Based Procedures for a Theory of Equality with Uninterpreted Functions

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Deciding Separation Formulas with SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Limits and possibilities of BDDs in state space search

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Equational binary decision diagrams

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide an automatic verification for a fragment of FOL quantifier-free logic with zero, successor and equality. We use BDD representation of such formulas and to verify them, we first introduce a (complete) term rewrite system to generate an equivalent Ordered(0,S,=)-BDD from any given (0,S,=)-BDD. Having the ordered representation of the BDDs, one can verify the original formula in constant time. Then, to have this transformation automatically, we provide an algorithm which will do the whole process.