Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/91086
Title: | CLARVA : model-based residual verification of Java programs |
Authors: | Azzopardi, Shaun Colombo, Christian Pace, Gordon J. |
Keywords: | Java (Computer program language) -- Software Computer software -- Verification Computer software -- Security measures |
Issue Date: | 2020 |
Publisher: | Springer |
Citation: | Azzopardi, S., Colombo, C., & Pace, G. (2020). CLARVA : model-based residual verification of Java programs. 8th International Conference on Model-Driven Engineering and Software Development - MODELSWARD, Valletta. 352-359. |
Abstract: | Runtime verification (RV) is an established approach that utilises monitors synthesized from a property language (e.g. temporal logics or some form of automata) to observe program behaviour at runtime, determining compliance of the program with the property at runtime. An issue with RV is that it introduces overheads at runtime, while identifying a violation at runtime may be too late. This can be tackled by introducing light analyses that attempt to prove parts of the property with respect to the program, leaving a residual property that induces a smaller monitoring footprint at runtime and encodes some static guarantees. In this paper we present CLARVA as a tool developed for this end for the RV tool LARVA. CLARVA transforms Java code into an automaton-based model, and allows for the incorporation of control-flow analyses that analyse this model against Dynamic Automata with Timers and Events or DATES (the property language used by LARVA) to produce residuals that produce an equivalent judgement at runtime. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/91086 |
Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
CLARVA_model-based_residual_verification_of_Java_programs_2020.pdf Restricted Access | 269.73 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.