2016
DOI: 10.1007/978-3-319-41540-6_12
|View full text |Cite
|
Sign up to set email alerts
|

Effectively Propositional Interpolants

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 26 publications
0
6
0
Order By: Relevance
“…A relatively recent alternative is to sample states that the interpolant must separate [Sharma et al 2012]. By iteratively sampling and combining the resulting interpoloants, it is possible to compute an interpolant of the (entire) formulas [Albarghouthi and McMillan 2013;Bjørner et al 2013;Chockler et al 2012;Drews and Albarghouthi 2016]. The interpolation procedure in the algorithm we analyze is from Bjørner et al [2013]; Chockler et al [2012], and inspired by IC3/PDR [Bradley 2011;Eén et al 2011].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…A relatively recent alternative is to sample states that the interpolant must separate [Sharma et al 2012]. By iteratively sampling and combining the resulting interpoloants, it is possible to compute an interpolant of the (entire) formulas [Albarghouthi and McMillan 2013;Bjørner et al 2013;Chockler et al 2012;Drews and Albarghouthi 2016]. The interpolation procedure in the algorithm we analyze is from Bjørner et al [2013]; Chockler et al [2012], and inspired by IC3/PDR [Bradley 2011;Eén et al 2011].…”
Section: Related Workmentioning
confidence: 99%
“…It samples from one side-the post image of the previous candidate-and computes an interpolant of the sample and the set of k-backwards reachable states. The EPR interpolation method by Drews and Albarghouthi [2016] is related, with diagrams replacing cubes as the least abstraction of states.…”
Section: Related Workmentioning
confidence: 99%
“…Lttp does so by synthesizing invariants over relational predicates that derive steps of execution that both load and store from related data structures. This ability enables Lttp to prove the safety of programs that cannot be proved safe by existing techniques based on EPL [16,29,31]. These approaches can prove properties expressed in terms of heap reachability within a linked list, but cannot verify properties that require application-specific inductive definitions [29].…”
Section: Illustrative Benchmarkmentioning
confidence: 99%
“…Previous work has proposed verifiers that determine if a program satisfies an assertion by inferring shape invariants represented as formulas in effectively-propositional logics [16,29,31]. Such verifiers enjoy strong completeness properties not satisfied by Lttp, but the class of invariants that they synthesize cannot express invariants over non-list data structures or that relate multiple lists.…”
Section: Related Workmentioning
confidence: 99%
“…If restricted to the alternation-free fragment, EPR and the array property fragment are closed under all logical operations. In [8], Drews and Albarghouti show that the alternation free EPR fragment is not closed under interpolation. We show in this paper a similar result for the (alternation free) array property fragment: we give an example for an interpolation problem where the input formulas are in the array property fragment and prove that there exists no interpolant within the array property fragment.…”
Section: Introductionmentioning
confidence: 99%