An interpolating decision procedure for transitive relations with uninterpreted functions

Authors:
Daniel Kroening;Georg Weissenbacher
Affiliations:
Computing Laboratory, Oxford University, ETH Zurich;Computing Laboratory, Oxford University and Computer Systems Institute, ETH Zurich
Venue:
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Year:
2009

Citing 16
Cited 4

Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpolating theorem prover

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Lifting Propositional Interpolants to the Word-Level

FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Ground Interpolation for the Theory of Equality

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Interpolant Generation for UTVPI

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Ground Interpolation for Combined Theories

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Verification and falsification of programs with loops using predicate abstraction

Formal Aspects of Computing
Delayed theory combination vs. nelson-oppen for satisfiability modulo theories: a comparative analysis

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Lazy abstraction with interpolants

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Applications of craig interpolants in model checking

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Yet another decision procedure for equality logic

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
A combination method for generating interpolants

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Proof-producing congruence closure

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Building efficient decision procedures on top of SAT solvers

SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems

Interpolation-based software verification with WOLVERINE

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Effective word-level interpolation for software verification

Proceedings of the International Conference on Formal Methods in Computer-Aided Design
WOLVERINE: battling bugs with interpolants

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Abstract satisfaction

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a proof-generating decision procedure for the quantifier-free fragment of first-order logic with the relations =, ≠, ≥, and and argue that this logic, augmented with a set of theory-specific rewriting rules, is adequate for bit-level accurate verification. We describe our decision procedure from an algorithmic point of view and explain how it is possible to efficiently generate Craig interpolants for this logic. Furthermore, we discuss the relevance of the logical fragment in software model checking and provide a preliminary evaluation of its applicability using an interpolation-based program analyser.