A program logic for resources

Aspinall, David; Beringer, Lennart; Hofmann, Martin; Loidl, Hans-Wolfgang; Momigliano, Alberto

doi:10.1016/j.tcs.2007.09.003

Cited by 39 publications

(35 citation statements)

References 59 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%

“…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 1 more Smart Citation

Relational Decomposition

Beringer

2011

Interactive Theorem Proving

Self Cite

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%

Section: Introductionmentioning

confidence: 99%

Relational Decomposition

Beringer

2011

Interactive Theorem Proving

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [4], it is shown how a logic that guarantees termination can be built "on top of" a partial-correctness logic, by including hypotheses from the latter logic in appropriate rules. Future work will seek to establish whether such a termination logic would be suitable for the interpretation of termination-sensitive notions of information flow, i.e.…”

Section: Discussionmentioning

confidence: 99%

Secure information flow and program logics

Beringer¹,

Hofmann²

2007

20th IEEE Computer Security Foundations Symposium (CSF'07)

Self Cite

View full text Add to dashboard Cite

We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-line non-interference, multi-level security and flow sensitivity for a while language, we show how typing derivations may be used to automatically generate proofs in the program logic that certify the absence of illicit flows. In addition, we present proof rules for baseline non-interference for object-manipulating instructions, As a consequence, standard verification technology may be used for verifying that a concrete program satisfies the noninterference property. Our development is based on a formalisation of the encodings in Isabelle/HOL.

show abstract

“…RÔH 1 , r 1 ÕÔH 2 , r 2 ÕÔH, r future Õ; (3) there exists at least one activation frame: fs f :: fs ½ and environment env cur , arguments args cur and post-condition Q cur ; such that (4) safeFrame Ôf, H 1 , r 1 , env cur , args cur , Q cur Õ; and (5) safeStack Ôfs, H 2 , r 2 , env cur , args cur , Q cur , env , args, QÕ.…”

Section: R Atkeymentioning

confidence: 99%

Amortised Resource Analysis with Separation Logic

Atkey¹

2011

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. Type-based amortised resource analysis following Hofmann and Jost-where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline-have been successful in providing concrete resource bounds for functional programs, with good support for inference. In this work we translate the idea of amortised resource analysis to imperative pointer-manipulating languages by embedding a logic of resources, based on the affine intuitionistic Logic of Bunched Implications, within Separation Logic. The Separation Logic component allows us to assert the presence and shape of mutable data structures on the heap, while the resource component allows us to state the consumable resources associated with each member of the structure.We present the logic on a small imperative language, based on Java bytecode, with procedures and mutable heap. We have formalised the logic and its soundness property within the Coq proof assistant and extracted a certified verification condition generator. We also describe an proof search procedure that allows generated verification conditions to be discharged while using linear programming to infer consumable resource annotations.We demonstrate the logic on some examples, including proving the termination of inplace list reversal on lists with cyclic tails.

show abstract

A program logic for resources

Cited by 39 publications

References 59 publications

Relational Decomposition

Relational Decomposition

Secure information flow and program logics

Amortised Resource Analysis with Separation Logic

Contact Info

Product

Resources

About