Verifying and reflecting quantifier elimination for presburger arithmetic

Authors:
Amine Chaieb;Tobias Nipkow
Affiliations:
Institut für Informatik, Technische Universität München;Institut für Informatik, Technische Universität München
Venue:
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2005

Citing 9
Cited 10

The Omega test: a fast and practical integer programming algorithm for dependence analysis

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
A compiled implementation of strong reduction

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Derivation and Use of Induction Schemes in Higher-Order Logic

TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Proof Terms for Simply Typed Higher Order Logic

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Executing Higher Order Logic

TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Elementary bounds for presburger arithmetic

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Dependent types ensure partial correctness of theorem provers

Journal of Functional Programming
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Proving equalities in a commutative ring done right in coq

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

Proof Synthesis and Reflection for Linear Arithmetic

Journal of Automated Reasoning
Context Aware Calculation and Deduction

Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Linear Quantifier Elimination

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Trust and Automation in Verification Tools

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Fast reflexive arithmetic tactics the linear case and beyond

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Formal Correctness Proof for DPLL Procedure

Informatica
Linear Quantifier Elimination

Journal of Automated Reasoning
A mechanical verification of the stressing algorithm for negative cost cycle detection in networks

Science of Computer Programming
Verifying mixed real-integer quantifier elimination

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an implementation and verification in higher-order logic of Cooper’s quantifier elimination for Presburger arithmetic. Reflection, i.e. the direct execution in ML, yields a speed-up of a factor of 200 over an LCF-style implementation and performs as well as a decision procedure hand-coded in ML.