Complete integer decision procedures as derived rules in HOL
Authors
NICTA
Abstract
I describe the implementation of two complete decision procedures for integer Presburger arithmetic in the HOL theorem-proving system. The first procedure is Cooper’s algorithm, the second, the Omega Test. Between them, the algorithms illustrate three different implementation techniques in a fully expansive system.
BibTeX Entry
@inproceedings{Norrish_03,
address = {Rome},
author = {Norrish, Michael},
booktitle = {International Conference on Theorem Proving in Higher Order Logics},
editor = {{D. Basin and B. Wolff}},
isbn = {978-3-540-40664-8},
month = sep,
pages = {71--86},
paperurl = {https://trustworthy.systems/publications/nicta_full_text/2138.pdf},
publisher = {Springer},
slides = {https://trustworthy.systems/publications/nicta_slides/2138.pdf},
title = {Complete Integer Decision Procedures as Derived Rules in {HOL}},
year = {2003}
}
Full text
Slides
BibTeX