StaRVOOrS : A Tool for Combined Static and Runtime Verification of Java

Chimento, Jesús Mauricio; Ahrendt, Wolfgang; Pace, Gordon J.; Schneider, Gerardo

doi:10.1007/978-3-319-23820-3_21

Cited by 27 publications

(14 citation statements)

References 3 publications

(13 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a final comment, this work began in [14] by exploring how the typestate analysis techniques employed by Clara [4,3] could be applied to QEA. The idea was to utilise pointer analysis information to statically check non-safety properties.…”

Section: Resultsmentioning

confidence: 99%

A Story of Parametric Trace Slicing, Garbage and Static Analysis

Reger

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

This paper presents a proposal (story) of how statically detecting unreachable objects (in Java) could be used to improve a particular runtime verification approach (for Java), namely parametric trace slicing. Monitoring algorithms for parametric trace slicing depend on garbage collection to (i) cleanup data-structures storing monitored objects, ensuring they do not become unmanageably large, and (ii) anticipate the violation of (non-safety) properties that cannot be satisfied as a monitored object can no longer appear later in the trace. The proposal is that both usages can be improved by making the unreachability of monitored objects explicit in the parametric property and statically introducing additional instrumentation points generating related events. The ideas presented in this paper are still exploratory and the intention is to integrate the described techniques into the MarQ monitoring tool for quantified event automata.

show abstract

Section: Resultsmentioning

confidence: 99%

A Story of Parametric Trace Slicing, Garbage and Static Analysis

Reger

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…The system StaDy [109] goes beyond this and uses dynamic verification to analyze failed proofs. The StaRVOOrS framework [34] generates optimized runtime assertion monitors for the unprovable parts of a specification.…”

Section: Integrationmentioning

confidence: 99%

Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools

Hähnle

Huisman

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Deductive software verification aims at formally verifying that all possible behaviors of a given program satisfy formally defined, possibly complex properties, where the verification process is based on logical inference. We follow the trajectory of the field from its inception in the late 1960s via its current state to its promises for the future, from pen-and-paper proofs for programs written in small, idealized languages to highly automated proofs of complex library or system code written in mainstream languages. We take stock of the state-of-art and give a list of the most important challenges for the further development of the field of deductive software verification.

show abstract

“…Another example of state-of-the-art combination of static and dynamic analysis framework is Unified Static and Runtime Verification of Object-Oriented Software 14 (StaRVOOrS, Chimento et al, 2015). In this case the combination has the goal of reducing the original specification by simplifying what can be proved statically, and produce a runtime specification for what needs dy-related work namic analysis.…”

Section: Static and Dynamic Analysismentioning

confidence: 99%

RML: runtime monitoring language

Franceschini

2019

Proceedings of the Conference Companion of the 3rd International Conference on Art, Science, and Engineering of Programming

View full text Add to dashboard Cite

A B S T R AC TRuntime verification is a relatively new software verification technique that aims to prove the correctness of a specific run of a program, rather than statically verify the code. The program is instrumented in order to collect all the relevant information, and the resulting trace of events is inspected by a monitor that verifies its compliance with respect to a specification of the expected properties of the system under scrutiny. Many languages exist that can be used to formally express the expected behavior of a system, with different design choices and degrees of expressivity.This thesis presents RML, a specification language designed for runtime verification, with the goal of being completely modular and independent from the instrumentation and the kind of system being monitored. RML is highly expressive, and allows one to express complex, parametric, non-context-free properties concisely. RML is compiled down to TC, a lower level calculus, which is fully formalized with a deterministic, rewriting-based semantics.In order to evaluate the approach, an open source implementation has been developed, and several examples with Node.js programs have been tested. Benchmarks show the ability of the monitors automatically generated from RML specifications to effectively and efficiently verify complex properties. v

show abstract

StaRVOOrS : A Tool for Combined Static and Runtime Verification of Java

Cited by 27 publications

References 3 publications

A Story of Parametric Trace Slicing, Garbage and Static Analysis

A Story of Parametric Trace Slicing, Garbage and Static Analysis

Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools

RML: runtime monitoring language

Contact Info

Product

Resources

About