Foundational static analysis

Appel, Andrew W.; Dockins, Robert; Hobor, Aquinas; Beringer, Lennart; Dodds, Josiah; Stewart, Gordon; Blazy, Sandrine; Leroy, Xavier

doi:10.1017/cbo9781107256552.054

Cited by 1 publication

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Relational decomposition is a technique for integrating relational logics into stacks of unary verification frameworks [6,4]. We established soundness and completeness of decomposition for general simulations, introduced relational variants of predicate transformers, and studied their relationship to unary transformers.…”

Section: Discussionmentioning

confidence: 99%

“…The derivation of the rules exhibits witnesses as mandated by equation (4). By the results of the previous section, witnesses for the atomic instruction forms may be chosen as φ…”

Section: Fig 2 Rhl Rules For Identically Shaped Phrases (Excerpt)mentioning

confidence: 99%

“…We demonstrate our technique by deriving a variant of Benton's Relational Hoare Logic (RHL, [13]) from a unary program logic, demonstrating that efforts invested into the construction of semantic models for unary logics can be harnessed for the justification of relational formalisms. We thus open an avenue for integrating relational logics into foundational stacks of verification formalisms [6,4].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Relational Decomposition

Beringer

2011

Interactive Theorem Proving

View full text Add to dashboard Cite

Abstract. We introduce relational decomposition, a technique for formally reducing termination-insensitive relational program logics to unary logics, that is program logics for one-execution properties. Generalizing the approach of selfcomposition, we develop a notion of interpolants that decompose along the phrase structure, and relate these interpolants to unary and relational predicate transformers. In contrast to previous formalisms, relational decomposition is applicable across heterogeneous pairs of transition systems. We apply our approach to justify variants of Benton's Relational Hoare Logic (RHL) for a language with objects, and present novel rules for relating loops that fail to proceed in lockstep. We also outline applications to noninterference and separation logic.

show abstract

Section: Discussionmentioning

confidence: 99%

“…The derivation of the rules exhibits witnesses as mandated by equation (4). By the results of the previous section, witnesses for the atomic instruction forms may be chosen as φ…”

Section: Fig 2 Rhl Rules For Identically Shaped Phrases (Excerpt)mentioning

confidence: 99%