Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods (2002)
Cached
Download Links
- [sprout.stanford.edu]
- [verify.stanford.edu]
- [www.cs.cmu.edu]
- DBLP
Other Repositories/Bibliography
by
Vijay Ganesh
,
Sergey Berezin
,
David L. Dill
| Venue: | In Proceedings of FMCAD 02 |
| Citations: | 13 - 1 self |
BibTeX
@INPROCEEDINGS{Ganesh02decidingpresburger,
author = {Vijay Ganesh and Sergey Berezin and David L. Dill},
title = {Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods},
booktitle = {In Proceedings of FMCAD 02},
year = {2002},
pages = {171--186},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a new way of using Binary Decision Diagrams in automata based algorithms for solving the satisfiability problem of quantifier-free Presburger arithmetic. Unlike in previous approaches [5, 2, 19], we translate the satisfiability problem into a model checking problem and use the existing BDD-based model checker SMV [13] as our primary engine.
