Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups

Lehner, Hermann; Müller, Péter

doi:10.1007/978-3-642-12029-9_24

Cited by 6 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous work have also explored other optimizations for runtime assertion checkers, for instance providing efficient representation of integers [8] or improving the verification of modifies clauses [9]. Regarding the former, Ortac benefits from zarith, which only switches to arbitrary-precision integers when machine integers are not large enough.…”

Section: Related Workmentioning

confidence: 99%

Optimizing Prestate Copies in Runtime Verification of Function Postconditions

Filliâtre

Pascutto

2022

Runtime Verification

View full text Add to dashboard Cite

In behavioural specifications of imperative languages, postconditions may refer to the prestate of the function, usually with an old operator. Therefore, code performing runtime verification has to record prestate values required to evaluate the postconditions, typically by copying part of the memory state, which causes severe verification overhead, both in memory and CPU time. In this paper, we consider the problem of efficiently capturing prestates in the context of Ortac, a runtime assertion checking tool for OCaml. Our contribution is a postcondition transformation that reduces the subset of the prestate to copy. We formalize this transformation, and we provide proof that it is sound and improves the performance of the instrumented programs. We illustrate the benefits of this approach with a maze generator. Our benchmarks show that unoptimized instrumentation is not practicable, while our transformation restores performances similar to the program without any runtime check.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimizing Prestate Copies in Runtime Verification of Function Postconditions

Filliâtre

Pascutto

2022

Runtime Verification

View full text Add to dashboard Cite

show abstract

“…There are systems that support static verification as well as monitoring of assignable clauses [23]. Data groups extend assignable clauses similar to an effect system [24].…”

Section: Comparison To Jml's Assignable Clausementioning

confidence: 99%

“…However, assignable is rarely used because its semantics has not been formally and unanimously defined until recently [22]. Furthermore, only a few tools implement run-time monitoring for JML with support for assignable clauses [23] and often not in full generality [4]. Lastly, the assignable mechanism is less flexible as access permission contracts, because it is bound to fixed classes.…”

Section: Introductionmentioning

confidence: 99%

Side effect monitoring for Java using bytecode rewriting

Geffken

Thiemann

2014

Proceedings of the 2014 International Conference on Principles and Practices of Programming on the Java Platform: Virtual Machi

View full text Add to dashboard Cite

A side effect of a method in Java is a read or write operation that the method may perform on an object in the heap. Methods with side effects are more difficult to understand and to reason about than pure methods, in particular in the presence of aliasing. While both, Java and the underlying Java Virtual Machine (JVM), support specifying and checking types statically, neither supports ways of specifying and checking side effects statically or at run time.We propose a technique to specify the side effects of a method and to perform fine-grained monitoring of its side effects at run time. It relies on a domain specific contract language to specify sets of memory locations, assign read and write permissions to them, and enforce these permissions during portions of a program's execution.We present a specification and an implementation of our monitoring technique.The implementation works independently of any particular JVM by employing bytecode rewriting. The implementation ensures complete interposition while supporting all languages and language features that run on a standard JVM. We evaluate the implementation on a set of benchmarks.

show abstract

“…Also, specification languages like JML [11,33] include a mechanism for specifying side effects, the assignable clause. While the JML toolchain supports verification as well as run-time monitoring [12,34,35], assignable clauses are not widely used, partly because their semantics has not been formally and unanimously defined until recently [35], and partly because support for assignable clauses is present in only a few tools that perform run-time monitoring for JML [36] and then not always in full generality [12].…”

Section: Related Workmentioning

confidence: 99%

Efficient dynamic access analysis using JavaScript proxies

Keil

Thiemann

2013

SIGPLAN Not.

View full text Add to dashboard Cite

JSConTest introduced the notions of effect monitoring and dynamic effect inference for JavaScript. It enables the description of effects with path specifications resembling regular expressions. It is implemented by an offline source code transformation. To overcome the limitations of the JSConTest implementation, we redesigned and reimplemented effect monitoring by taking advantange of JavaScript proxies. Our new design avoids all drawbacks of the prior implementation. It guarantees full interposition; it is not restricted to a subset of JavaScript; it is self-maintaining; and its scalability to large programs is significantly better than with JSConTest. The improved scalability has two sources. First, the reimplementation is significantly faster than the original, transformation-based implementation. Second, the reimplementation relies on the fly-weight pattern and on trace reduction to conserve memory. Only the combination of these techniques enables monitoring and inference for large programs.

show abstract

Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups

Cited by 6 publications

References 9 publications

Optimizing Prestate Copies in Runtime Verification of Function Postconditions

Optimizing Prestate Copies in Runtime Verification of Function Postconditions

Side effect monitoring for Java using bytecode rewriting

Efficient dynamic access analysis using JavaScript proxies

Contact Info

Product

Resources

About