Article

Disjunctive Interpolants for Horn-Clause Verification

Authors:

Philipp Rümmer,

Hossein Hojjat,

Viktor KuncakAuthors Info & Claims

CAV 2013: Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044

Pages 347 - 363

Published: 13 July 2013 Publication History

Abstract

One of the main challenges in software verification is efficient and precise compositional analysis of programs with procedures and loops. Interpolation methods remains one of the most promising techniques for such verification, and are closely related to solving Horn clause constraints. We introduce a new notion of interpolation, disjunctive interpolation, which solves a more general class of problems in one step compared to previous notions of interpolants, such as tree interpolants or inductive sequences of interpolants. We present algorithms and complexity for construction of disjunctive interpolants, as well as their use within an abstraction-refinement loop. We have implemented Horn clause verification algorithms that use disjunctive interpolants and evaluate them on benchmarks expressed as Horn clauses over the theory of integer linear arithmetic.

References

[1]

Albarghouthi, A., Gurfinkel, A., Chechik, M.: Craig interpretation. In: Miné, A., Schmidt, D. eds. SAS 2012. LNCS, vol. 7460, pp. 300---316. Springer, Heidelberg 2012

Digital Library

[2]

Albarghouthi, A., Gurfinkel, A., Chechik, M.: whale: An interpolation-based algorithm for inter-procedural verification. In: Kuncak, V., Rybalchenko, A. eds. VMCAI 2012. LNCS, vol. 7148, pp. 39---55. Springer, Heidelberg 2012

Digital Library

[3]

Ball, T., Podelski, A., Rajamani, S.K.: Relative completeness of abstraction refinement for software model checking. In: Katoen, J.-P., Stevens, P. eds. TACAS 2002. LNCS, vol. 2280, pp. 158---172. Springer, Heidelberg 2002

Digital Library

[4]

Brillout, A., Kroening, D., Rümmer, P., Wahl, T.: An interpolating sequent calculus for quantifier-free Presburger arithmetic. Journal of Automated Reasoning 47, 341---367 2011

Digital Library

[5]

Cimatti, A., Griggio, A., Sebastiani, R.: Efficient generation of Craig interpolants in satisfiability modulo theories. ACM Trans. Comput. Log. 121, 7 2010

Digital Library

[6]

Craig, W.: Linear reasoning. A new form of the Herbrand-Gentzen theorem. The Journal of Symbolic Logic 223, 250---268 1957

[7]

Ganty, P., Majumdar, R.: Algorithmic verification of asynchronous programs. CoRR, abs/1011.0551 2010

Digital Library

[8]

Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. ed. CAV 1997. LNCS, vol. 1254, pp. 72---83. Springer, Heidelberg 1997

Digital Library

[9]

Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: PLDI 2012

Digital Library

[10]

Gupta, A., Popeea, C., Rybalchenko, A.: Predicate abstraction and refinement for verifying multi-threaded programs. In: POPL 2011

Digital Library

[11]

Gupta, A., Popeea, C., Rybalchenko, A.: Solving recursion-free horn clauses over LI+UIF. In: Yang, H. ed. APLAS 2011. LNCS, vol. 7078, pp. 188---203. Springer, Heidelberg 2011

Digital Library

[12]

Heizmann, M., Hoenicke, J., Podelski, A.: Nested interpolants. In: POPL 2010

Digital Library

[13]

Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: POPL, pp. 232---244. ACM 2004

Digital Library

[14]

Hoder, K., BjØrner, N.: Generalized property directed reachability. In: Cimatti, A., Sebastiani, R. eds. SAT 2012. LNCS, vol. 7317, pp. 157---171. Springer, Heidelberg 2012

Digital Library

[15]

Hojjat, H., Iosif, R., Koneă ný, F., Kuncak, V., Rümmer, P.: Accelerating interpolants. In: Chakraborty, S., Mukund, M. eds. ATVA 2012. LNCS, vol. 7561, pp. 187---202. Springer, Heidelberg 2012

Digital Library

[16]

Hojjat, H., Koneă ný, F., Garnier, F., Iosif, R., Kuncak, V., Rümmer, P.: A verification toolkit for numerical transition systems tool paper. In: Giannakopoulou, D., Méry, D. eds. FM 2012. LNCS, vol. 7436, pp. 247---251. Springer, Heidelberg 2012

[17]

Jhala, R., Majumdar, R., Rybalchenko, A.: HMC: Verifying functional programs using abstract interpreters. In: Gopalakrishnan, G., Qadeer, S. eds. CAV 2011. LNCS, vol. 6806, pp. 470---485. Springer, Heidelberg 2011

Digital Library

[18]

Lal, A., Qadeer, S., Lahiri, S.K.: A solver for reachability modulo theories. In: Madhusudan, P., Seshia, S.A. eds. CAV 2012. LNCS, vol. 7358, pp. 427---443. Springer, Heidelberg 2012

Digital Library

[19]

McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt Jr., W.A., Somenzi, F. eds. CAV 2003. LNCS, vol. 2725, pp. 1---13. Springer, Heidelberg 2003

[20]

McMillan, K.L.: Lazy abstraction with interpolants. In: Ball, T., Jones, R.B. eds. CAV 2006. LNCS, vol. 4144, pp. 123---136. Springer, Heidelberg 2006

Digital Library

[21]

McMillan, K.L., Rybalchenko, A.: Solving constrained Horn clauses using interpolation. Technical Report MSR-TR-2013-6, Microsoft Research January 2013

[22]

Méndez-Lojo, M., Navas, J., Hermenegildo, M.V.: A flexible CLP-based approach to the analysis of object-oriented programs. In: King, A. ed. LOPSTR 2007. LNCS, vol. 4915, pp. 154---168. Springer, Heidelberg 2008

Digital Library

[23]

Peralta, J.C., Gallagher, J.P., Saglam, H.: Analysis of imperative programs through analysis of constraint logic programs. In: Levi, G. ed. SAS 1998. LNCS, vol. 1503, pp. 246---261. Springer, Heidelberg 1998

Digital Library

[24]

Rümmer, P., Hojjat, H., Kuncak, V.: Classifying and solving horn clauses for verification. In: VSTTE 2013

[25]

Rümmer, P., Hojjat, H., Kuncak, V.: Disjunctive interpolants for horn-clause verification extended technical report. CoRR, abs/1301.4973 2013

[26]

Sery, O., Fedyukovich, G., Sharygina, N.: Interpolation-based function summaries in bounded model checking. In: Eder, K., Lourenço, J., Shehory, O. eds. HVC 2011. LNCS, vol. 7261, pp. 160---175. Springer, Heidelberg 2012

Digital Library

[27]

Terauchi, T.: Dependent types from counterexamples. In: Hermenegildo, M.V., Palsberg, J. eds. POPL, pp. 119---130. ACM 2010

Digital Library

[28]

Unno, H., Terauchi, T., Kobayashi, N.: Automating relatively complete verification of higher-order functional programs. In: POPL 2013

Digital Library

Cited By

Zhu HMagill SJagannathan S(2018)A data-driven CHC solverACM SIGPLAN Notices10.1145/3296979.319241653:4(707-721)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3296979.3192416
Zhu HMagill SJagannathan SFoster JGrossman D(2018)A data-driven CHC solverProceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3192366.3192416(707-721)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3192366.3192416
Kersten RSchäf MKahsai T(2017)Resource Contracts for JavaACM SIGSOFT Software Engineering Notes10.1145/3011286.301129441:6(1-5)Online publication date: 5-Jan-2017
https://dl.acm.org/doi/10.1145/3011286.3011294
Show More Cited By

Index Terms

Disjunctive Interpolants for Horn-Clause Verification

Index terms have been assigned to the content through auto-classification.

Recommendations

Computing in Horn Clause Theories
Predicate completion for non-Horn clause sets
CADE'11: Proceedings of the 23rd international conference on Automated deduction

The standard semantics of a logical program described by a set of predicative Horn clauses is minimal model semantics. To reason about negation in this context, Clark proposed to enrich the description in such a way that all Herbrand models but the ...
Horn clause computability
Abstract
It is proved that a Turing computable functionf is computable in binary Horn clauses, which are a subset of first order logic. Moreover, it is proved that the binary Horn clauses do not need more than one function symbol. The proofs comprise ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CAV 2013: Proceedings of the 25th International Conference on Computer Aided Verification - Volume 8044

July 2013

1012 pages

ISBN:9783642397981

Editors:
Natasha Sharygina
University of Lugano, Lugano, Switzerland
,
Helmut Veith
University of Technology, Vienna, Austria

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 13 July 2013

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhu HMagill SJagannathan S(2018)A data-driven CHC solverACM SIGPLAN Notices10.1145/3296979.319241653:4(707-721)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3296979.3192416
Zhu HMagill SJagannathan SFoster JGrossman D(2018)A data-driven CHC solverProceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3192366.3192416(707-721)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3192366.3192416
Kersten RSchäf MKahsai T(2017)Resource Contracts for JavaACM SIGSOFT Software Engineering Notes10.1145/3011286.301129441:6(1-5)Online publication date: 5-Jan-2017
https://dl.acm.org/doi/10.1145/3011286.3011294
Roy SKot LBender GDing BHojjat HKoch CFoster NGehrke JSellis TDavidson SIves Z(2015)The Homeostasis ProtocolProceedings of the 2015 ACM SIGMOD International Conference on Management of Data10.1145/2723372.2723720(1311-1326)Online publication date: 27-May-2015
https://dl.acm.org/doi/10.1145/2723372.2723720
Felsing DGrebing SKlebanov VRümmer PUlbrich MCrnkovic IChechik MGrünbacher P(2014)Automating regression verificationProceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering10.1145/2642937.2642987(349-360)Online publication date: 15-Sep-2014
https://dl.acm.org/doi/10.1145/2642937.2642987

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents