Fast as a shadow, expressive as a tree: Optimized memory monitoring for C

Jakobsson, Arvid; Kosmatov, Nikolaï; Signoles, Julien

doi:10.1016/j.scico.2016.09.003

Cited by 12 publications

(18 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By default, this function stops the program execution with a precise error message if a is 0 (i.e., false) and just continues the execution otherwise. The generated code is linked against a dedicated memory library which can efficiently compute the validity of complex memory-related properties (e.g., use-after-free or initialization of variables) [56,64].…”

Section: E-acslmentioning

confidence: 99%

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

Bartocci

Falcone

Bonakdarpour

et al. 2017

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

The first international Competition on Runtime Verification (CRV) was held in September 2014, in Toronto, Canada, as a satellite event of the 14th international conference on Runtime Verification (RV'14). The event was organized in three tracks: (1) offline monitoring, (2) online monitoring of C programs, and (3) online monitoring of Java programs. In this paper, we report on the phases and rules, a description of the participating teams and their submitted benchmark, the (full) results, as well as the lessons learned from the competition.

show abstract

Section: E-acslmentioning

confidence: 99%

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

Bartocci

Falcone

Bonakdarpour

et al. 2017

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

show abstract

“…Two static analyses are executed prior to code generation. One analysis identifies the goto-like statements which go outside blocks in order to soundly insert necessary code when exiting a block, while the other one finds out an over-approximation of the statements which are necessary to monitor in order to verify memory properties (if any) [13]. For instance, considering a pointer p of type int* and a program containing a single annotation \valid(p), it is only necessary to monitor statements which assign p and its potential aliases.…”

Section: Monitor Generation Schemementioning

confidence: 99%

“…Over the past several years E-ACSL has been experimentally evaluated and used in a number of case studies involving runtime verification of benchmarked and industrial-strength code [15,13,4,2,21,29,28]. This section now briefly summarizes the results of these experiments.…”

Section: Practical Runtime Verification With E-acslmentioning

confidence: 99%

“…This is such that memory modifications made by the program at runtime are stored in the library by the monitor and checking annotations corresponds to querying it. Before program instrumentation, static analysis is performed to safely remove unnecessary memory instrumentation to improve efficiency of the monitor [13]. Memory monitoring in E-ACSL has initially been implemented using a compact prefix tree called patricia trie [15].…”

Section: Runtime Detection Of Memory Errorsmentioning

confidence: 99%

“…Even though several papers have already described such E-ACSL components as its specification language [8], memory model [29,28], static analyses to optimize code generation [12,13], and possible usages in conjunction with other Frama-C plug-ins [17,21,2], this paper aims at presenting a quick overview of the whole tool.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

E-ACSL, a Runtime Verification Tool for Safety and Security of C Programs (tool paper)

Signoles

Kosmatov

Vorobyov³

Kalpa Publications in Computing

Self Cite

View full text Add to dashboard Cite

This tool paper presents E-ACSL, a runtime verification tool for C programs capable of checking a broad range of safety and security properties expressed using a formal specification language. E-ACSL consumes a C program annotated with formal specifications and generates a new C program that behaves similarly to the original if the formal properties are satisfied, or aborts its execution whenever a property does not hold. This paper presents an overview of E-ACSL and its specification language.

show abstract

Verified Runtime Assertion Checking for Memory Properties

Kosmatov

Loulergue

et al. 2020

Tests and Proofs

Self Cite

View full text Add to dashboard Cite

Runtime Assertion Checking (RAC) for expressive specification languages is a non-trivial verification task, that becomes even more complex for memory-related properties of imperative languages with dynamic memory allocation. It is important to ensure the soundness of RAC verdicts, in particular when RAC reports the absence of failures for execution traces. This paper presents a formalization of a program transformation technique for RAC of memory properties for a representative language with memory operations. It includes an observation memory model that is essential to record and monitor memory-related properties. We prove the soundness of RAC verdicts with regard to the semantics of this language.

show abstract

Fast as a shadow, expressive as a tree: Optimized memory monitoring for C

Cited by 12 publications

References 7 publications

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

First international Competition on Runtime Verification: rules, benchmarks, tools, and final results of CRV 2014

E-ACSL, a Runtime Verification Tool for Safety and Security of C Programs (tool paper)

Verified Runtime Assertion Checking for Memory Properties

Contact Info

Product

Resources

About