Interpolant generation without constructing resolution graph

Authors:
Chih-Jen Hsu;Shao-Lun Huang;Chi-An Wu;Chung-Yang (Ric) Huang
Affiliations:
National Taiwan University, Taiwan;National Taiwan University, Taiwan;National Taiwan University, Taiwan;National Taiwan University, Taiwan
Venue:
Proceedings of the 2009 International Conference on Computer-Aided Design
Year:
2009

Citing 6
Cited 2

Scalable exploration of functional dependency by interpolation and incremental SAT solving

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Bi-decomposing large Boolean functions via interpolation and satisfiability solving

Proceedings of the 45th annual Design Automation Conference
Scalable don't-care-based logic optimization and resynthesis

Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
Using an SMT solver and Craig interpolation to detect and remove redundant linear constraints in representations of non-convex polyhedra

SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Lazy abstraction with interpolants

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Interpolant-based transition relation approximation

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

A robust functional ECO engine by SAT proof minimization and interpolation techniques

Proceedings of the International Conference on Computer-Aided Design
A counterexample-guided interpolant generation algorithm for SAT-based model checking

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we proposed a novel interpolant generation algorithm without constructing the resolution graph of the unsatisfiability proof. Our algorithm generates the interpolant by building sub-interpolants from conflict analyses and then merges them based on the last decision conflict. The experimental results show that our algorithm has the advantages over the prior interpolant generation techniques in both memory usage and interpolation circuit size.