Square root and division elimination in PVS

Authors:
Pierre Neron
Affiliations:
École polytechnique - INRIA, France
Venue:
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Year:
2013

Citing 6
Cited 0

PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition: a synopsis

ACM SIGSAM Bulletin
CVC3

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Improving Coq propositional reasoning using a lazy CNF conversion scheme

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
A formal proof of square root and division elimination in embedded programs

CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new strategy for PVS that implements a square root and division elimination in order to use automatic arithmetic strategies that were not able to deal with these operations in the first place. This strategy relies on a PVS formalization of the square root and division elimination and deep embedding of PVS expressions inside PVS. Therefore using computational reflection and symbolic computation we are able to automatically transform expressions into division and square root free ones before using these decision procedures.