Amortised Resource Analysis with Separation Logic

Atkey, Robert

doi:10.2168/lmcs-7(2:17)2011

Cited by 52 publications

(68 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…See Atkey [3] for a complete description of the assertion logic. We can represent a heap H and a consumable resource r that satisfy this predicate graphically:…”

Section: Integrating the Banker's Methods And Separation Logicmentioning

confidence: 99%

“…In OCaml we have implemented a proof search procedure that solves verification conditions using a similar technique to other automated verification tools for Separation Logic [11]. See Atkey [3] for more details. In our proof search implementation, we can leave resource annotations, e.g.…”

Section: Methodsmentioning

confidence: 99%

“…Hofmann and Jost [21] applied this technique to first-order functional programs to yield an automated resource analysis. Atkey [3] has recently adapted this work to integrate with Separation Logic [22,34] to extend the automated technique to pointer-manipulating imperative programs. In this section we give an overview of Atkey's work and describe some examples.…”

Section: Amortised Resource Analysismentioning

confidence: 99%

“…The amortised approach exploits the shape-reasoning already present in Separation Logic to account for resources. For further elaboration of this point, and a demonstration of the use of amortised specification to improve information hiding in specifications, see the functional queues example in [3].…”

Section: A More Complex Examplementioning

confidence: 99%

See 3 more Smart Citations

Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode

Aspinall

Atkey

MacKenzie

et al. 2010

Trustworthly Global Computing

Self Cite

View full text Add to dashboard Cite

Abstract. Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap shapes, in the tradition of separation logic, and assertions about consumable resources. Separately, polyhedral methods have been used to calculate bounds on numbers of iterations in loop-based programs. We are attempting to combine these ideas to deal with Java programs involving both data structures and loops, focusing on the bytecode level rather than on source code.

show abstract

“…See Atkey [3] for a complete description of the assertion logic. We can represent a heap H and a consumable resource r that satisfy this predicate graphically:…”

Section: Integrating the Banker's Methods And Separation Logicmentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

Section: Amortised Resource Analysismentioning

confidence: 99%

Section: A More Complex Examplementioning

confidence: 99%

See 2 more Smart Citations

Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode

Aspinall

Atkey

MacKenzie

et al. 2010

Trustworthly Global Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many papers have been published on resource analysis [1,2] and loop bound is just one example of resource. The associated algorithms generally target more difficult loop bounds that WCET tools like SWEET or our own tool.…”

Section: Related Workmentioning

confidence: 99%

Formal Verification of Loop Bound Estimation for WCET Analysis

Blazy¹,

Maroneze²,

Pichardie³

2014

Verified Software: Theories, Tools, Experiments

View full text Add to dashboard Cite

Abstract. Worst-case execution time (WCET) estimation tools are complex pieces of software performing tasks such as computation on control flow graphs (CFGs) and bound calculation. In this paper, we present a formal verification (in Coq) of a loop bound estimation. It relies on program slicing and bound calculation. The work has been integrated into the CompCert verified C compiler. Our verified analyses directly operate on non-structured CFGs. We extend the CompCert RTL intermediate language with a notion of loop nesting (a.k.a. weak topological ordering on CFGs) that is useful for reasoning on CFGs. The automatic extraction of our loop bound estimation into OCaml yields a program with competitive results, obtained from experiments on a reference benchmark for WCET bound estimation tools.

show abstract

Safety‐critical Java for embedded systems

Schoeberl

Dalsgaard

Hansen

et al. 2016

Concurrency and Computation

View full text Add to dashboard Cite

Phone +45 4525 3351 compute@compute.dtu.dk www.compute.dtu.dk IMM-PhD-2014-340 Summary (English) Safety-critical systems are real-time systems whose failure can have severe or catastrophic consequences, possibly endangering human life. Many safety-critical systems incorporate embedded computers used to control different tasks. Software running on safety-critical systems needs to be certified before its deployment and the most time-consuming step of this process is the testing and verification phase. Due to the increasing complexity in safety-critical systems there is a need for new technologies that can facilitate testing and verification activities.The safety-critical specification for Java aims at providing a reduced set of the Java programming language that can be used for systems that need to be certified at the highest levels of criticality. Safety-critical Java (SCJ) restricts how a developer can structure an application by providing a specific programming model and by restricting the set of methods and libraries that can be used. Furthermore, its memory model do not use a garbage-collected heap but scoped memories.In this thesis we examine the use of the SCJ specification through an implementation in a time-predictable, FPGA-based Java processor. The specification is now in a mature state and with our implementation we have proved its feasibility in an embedded platform. Moreover, we have explored how simple hardware extensions can reduce the execution time of time-critical operations required by the SCJ specification.The scoped memory model used in SCJ is perhaps one of its most difficult features to use correctly. Therefore, in this work we have also studied practical aspects of its usage by developing scoped memory use patterns and reusable libraries aiming at facilitating the development of complex software systems.ii Summary (Danish)Sikkerhedskritiske systemer er realtidssystemer. Hvis sådanne systemer fejler, kan det have alvorlige eller katastrofale konsekvenser, muligvis livsfarlige konsekvenser. Mange sikkerhedskritiske systemer inkorporerer embeddede computere, som bruges til at kontrollere forskellige opgaver. Software, som kører på sikkerhedskritiske systemer, skal certificeres, før softwaren udrulles, og det mest tidskraevende skridt i denne proces er test-og verifikationsfasen. På grund af den stigende kompleksitet i sikkerhedskritiske systemer er der behov for nye teknologier til at facilitere test-og verifikationsaktiviteter.Den sikkerhedskritiske specifikation for Java har til formål at levere en reduceret udgave af Java-programmeringssproget, som kan bruges til systemer, der skal kunne certificeres på de højeste kritikalitetsniveauer. Safety Critical Java (SCJ) begraenser, hvordan en udvikler kan strukturere en applikation, ved at levere en specifik programmeringsmodel og ved at begraense de metoder og biblioteker, som kan anvendes. Derudover benytter hukommelsesmodellen i SCJ ikke en heap, der er garbage-collected, men afgraensede hukommelser.I denne afhandling undersøger vi brugen a...

show abstract

Amortised Resource Analysis with Separation Logic

Cited by 52 publications

References 26 publications

Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode

Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode

Formal Verification of Loop Bound Estimation for WCET Analysis

Safety‐critical Java for embedded systems

Contact Info

Product

Resources

About