Challenges in decomposing encodings of verification problems

Schrammel, Peter (2016) Challenges in decomposing encodings of verification problems. Electronic Proceedings in Theoretical Computer Science, 219. pp. 29-32. ISSN 2075-2180

[img] PDF - Submitted Version
Available under License Creative Commons Attribution.

Download (124kB)
[img] PDF - Published Version
Available under License Creative Commons Attribution.

Download (48kB)


Modern program verifiers use logic-based encodings of the verification problem that are discharged by a back end reasoning engine. However, instances of such encodings for large programs can quickly overwhelm these back end solvers. Hence, we need techniques to make the solving process scale to large systems, such as partitioning (divide-and-conquer) and abstraction.

In recent work, we showed how decomposing the formula encoding of a termination analysis can significantly increase efficiency. The analysis generates a sequence of logical formulas with existentially quantified predicates that are solved by a synthesis-based program analysis engine. However, decomposition introduces abstractions in addition to those required for finding the unknown predicates in the formula, and can hence deteriorate precision. We discuss the challenges associated with such decompositions and their interdependencies with the solving process.

Item Type: Article
Additional Information: Proceedings of the 3rd Workshop on Horn Clauses for Verification and Synthesis (HCVSS2016), Eindhoven, The Netherlands, 3rd April 2016.
Keywords: Verification, Logical encoding, Decomposition, Interprocedural termination analysis
Schools and Departments: School of Engineering and Informatics > Informatics
Subjects: Q Science > QA Mathematics > QA0075 Electronic computers. Computer science
Depositing User: Peter Schrammel
Date Deposited: 04 Aug 2016 10:48
Last Modified: 02 Jul 2019 18:24

View download statistics for this item

📧 Request an update