Proof certificates and non-linear arithmetic constraints

Symbolic methods in computer-aided verification rely heavily on constraint solvers. The correctness and reliability of these solvers are of vital importance in the analysis of safety-critical systems, e.g., in the automotive context. Satisfiability results of a solver can usually be checked by probi...

Full description

Saved in:
Bibliographic Details
Published in14th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems pp. 429 - 434
Main Authors Kupferschmid, S, Becker, B, Teige, T, Franzle, M
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2011
Subjects
Algorithm design and analysis
Benchmark testing
Calculus
Cost accounting
Iterative closest point algorithm
Reactive power
Syntactics
Online AccessGet full text

Cover

More Information
Summary:Symbolic methods in computer-aided verification rely heavily on constraint solvers. The correctness and reliability of these solvers are of vital importance in the analysis of safety-critical systems, e.g., in the automotive context. Satisfiability results of a solver can usually be checked by probing the computed solution. This is in general not the case for un-satisfiability results. In this paper, we propose a certification method for unsatisfiability results for mixed Boolean and non-linear arithmetic constraint formulae. Such formulae arise in the analysis of hybrid discrete/continuous systems. Furthermore, we test our approach by enhancing the iSAT constraint solver to generate unsatisfiability proofs, and implemented a tool that can efficiently validate such proofs. Finally, some experimental results showing the effectiveness of our techniques are given.
ISBN:1424497558
9781424497553
DOI:10.1109/DDECS.2011.5783131