Concise Outlines for a Complex Logic: A Proof Outline Checker for TaDA

Wolf, Felix A.; Schwerhoff, Malte; Müller, Péter

doi:10.1007/978-3-030-90870-6_22

Cited by 9 publications

(8 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To evaluate Diaframe and its implementation, we have verified 24 examples with different levels of complexity. These examples include all the examples used to evaluate Caper [31], Starling [90] and Voila [91], and 5 additional, closely related examples. Our examples do not always correspond line-forline to the examples from other tools, since the programming languages are different, but the required concurrency reasoning is similar.…”

Section: Implementation and Evaluationmentioning

confidence: 99%

“…Caper's proof automation is also simply more powerfulÐnotably, it will 'blindly' open regions in the hope they help proving the goal. Although this makes Caper's automation more powerful, it also makes it slow on failing examples as pointed out by Wolf et al [91]. In these cases, Diaframe's automation will simply stop at the point where it cannot make progress, while Caper will backtrack through all possible options.…”

Section: Implementation and Evaluationmentioning

confidence: 99%

“…Voila. Voila [91] is a proof outline checker for the TaDA logic [25]. Voila takes a user-provided proof outline, turns it into a proof candidate, then verifies this with Viper [65].…”

Section: Implementation and Evaluationmentioning

confidence: 99%

“…We focus on related work in automated verification. Starling [90], Caper [31] and Voila [91] have been covered in ğ6.…”

Section: Related Workmentioning

confidence: 99%

“…Tools with good automation like Caper [31], Starling [90] and Voila [91], generally use SMT [27] or separation-logic solvers [65,73] as trusted oracles. They are capable of proving programs correct with relatively little help from the user, allowing quick experimentation when designing algorithms.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Diaframe: automated verification of fine-grained concurrent programs in Iris

Mulder

Krebbers

Geuvers

2022

Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

Fine-grained concurrent programs are difficult to get right, yet play an important role in modern-day computers. We want to prove strong specifications of such programs, with minimal user effort, in a trustworthy way. In this paper, we present DiaframeÐan automated and foundational verification tool for fine-grained concurrent programs.Diaframe is built on top of the Iris framework for higherorder concurrent separation logic in Coq, which already has a foundational soundness proof and the ability to give strong specifications, but lacks automation. Diaframe equips Iris with strong automation using a novel, extendable, goaldirected proof search strategy, using ideas from linear logic programming and bi-abduction. A benchmark of 24 examples from the literature shows that the proof burden of Diaframe is competitive with existing non-foundational tools, while its expressivity and soundness guarantees are stronger.

show abstract

Section: Implementation and Evaluationmentioning

confidence: 99%

Section: Implementation and Evaluationmentioning

confidence: 99%

“…Voila. Voila [91] is a proof outline checker for the TaDA logic [25]. Voila takes a user-provided proof outline, turns it into a proof candidate, then verifies this with Viper [65].…”

Section: Implementation and Evaluationmentioning

confidence: 99%

“…We focus on related work in automated verification. Starling [90], Caper [31] and Voila [91] have been covered in ğ6.…”

Section: Related Workmentioning

confidence: 99%