An efficient and flexible approach to resolution proof reduction

Authors:
Simone Fulvio Rollini;Roberto Bruttomesso;Natasha Sharygina
Affiliations:
University of Lugano, Formal Verification Group, Lugano, Switzerland;University of Lugano, Formal Verification Group, Lugano, Switzerland;University of Lugano, Formal Verification Group, Lugano, Switzerland
Venue:
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
Year:
2010

Citing 13
Cited 4

Formal methods for the validation of automotive product configuration data

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Abstractions from proofs

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Compressing Propositional Refutations

Electronic Notes in Theoretical Computer Science (ENTCS)
Data Compression for Proof Replay

Journal of Automated Reasoning
Linear-Time Reductions of Resolution Proofs

HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Automatic abstraction without counterexamples

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Compressing propositional proofs by common subproof extraction

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Interpolant strength

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Flexible interpolation with local proof transformations

Proceedings of the International Conference on Computer-Aided Design
Interpolant-based transition relation approximation

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Two techniques for minimizing resolution proofs

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
The OpenSMT solver

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Leveraging interpolant strength in model checking

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Improved single pass algorithms for resolution proof reduction

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Lemma localization: a practical method for downsizing SMT-interpolants

Proceedings of the Conference on Design, Automation and Test in Europe
Efficient generation of small interpolants in CNF

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

A resoution proof is a certificate of the unsatisfiability of a Boolean formula. Resolution proofs, as generated by modern SAT solvers, find application in many verification techniques. For efficiency smaller proofs are preferable over larger ones. This paper presents a new approach to proof reduction, situated among the purely post-processing methods. The main idea is to reduce the proof size by eliminating redundancies of occurrences of pivots along the proof paths. This is achieved by matching and rewriting local contexts into simpler ones. In our approach, rewriting can be easily customized in the way local contexts are matched, in the amount of transformations to be performed, or in the different application of the rewriting rules. We provide an extensive experimental evaluation of our technique on a set of benchmarks, which shows considerable reduction in the proofs size.