Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1607.04458 (cs)
[Submitted on 15 Jul 2016]

Title:Challenges in Decomposing Encodings of Verification Problems

Authors:Peter Schrammel (University of Oxford)
View PDF
Abstract: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.
Comments: In Proceedings HCVS2016, arXiv:1607.04033
Subjects: Logic in Computer Science (cs.LO); Software Engineering (cs.SE)
Cite as: arXiv:1607.04458 [cs.LO]
  (or arXiv:1607.04458v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.1607.04458
Journal reference: EPTCS 219, 2016, pp. 29-32
Related DOI: https://doi.org/10.4204/EPTCS.219.3

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Fri, 15 Jul 2016 11:04:59 UTC (12 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2016-07
Change to browse by:
cs
cs.SE

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)