TY - GEN
T1 - Synthesis of circular compositional program proofs via abduction
AU - Li, Boyang
AU - Dillig, Isil
AU - Dillig, Thomas
AU - McMillan, Ken
AU - Sagiv, Mooly
N1 - Funding Information: This work is supported in part by DARPA #FA8750-12-2-0020.
PY - 2013
Y1 - 2013
N2 - This paper presents a technique for synthesizing circular compositional proofs of program correctness. Our technique uses abductive inference to decompose the proof into small lemmas, which are represented as small program fragments annotated with pre and post-conditions. Different tools are used to discharge each different lemma, combining the strengths of different verifiers. Furthermore, each lemma concerns the correctness of small syntactic fragments of the program, addressing scalability concerns. We have implemented this technique and used it combine four different verification tools. Our experiments show that our technique can be successfully used to verify applications that cannot be verified by any individual technique.
AB - This paper presents a technique for synthesizing circular compositional proofs of program correctness. Our technique uses abductive inference to decompose the proof into small lemmas, which are represented as small program fragments annotated with pre and post-conditions. Different tools are used to discharge each different lemma, combining the strengths of different verifiers. Furthermore, each lemma concerns the correctness of small syntactic fragments of the program, addressing scalability concerns. We have implemented this technique and used it combine four different verification tools. Our experiments show that our technique can be successfully used to verify applications that cannot be verified by any individual technique.
UR - http://www.scopus.com/inward/record.url?scp=84874418694&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-642-36742-7_26
DO - https://doi.org/10.1007/978-3-642-36742-7_26
M3 - منشور من مؤتمر
SN - 9783642367410
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 370
EP - 384
BT - Tools and Algorithms for the Construction and Analysis of Systems - 19th Int. Conf., TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Proc.
T2 - 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013
Y2 - 16 March 2013 through 24 March 2013
ER -