Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis

Alpuente, María; Ballis, Demis; Frechina, Francisco; Sapiña, Julia

doi:10.1007/978-3-319-23165-5_3

Cited by 7 publications

(3 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We believe that this integration can improve the quality of the analysis, allowing for more erroneous/unexpected behaviours to be detected. We also want to extend the forward slicing algorithm to a language for concurrent multiparty communications [38], and investigate possible extensions that exploit static analysis techniques [39][40][41] as well as dynamic verification methodologies [42,43].…”

Section: Discussionmentioning

confidence: 99%

Modeling and Analyzing Reaction Systems in Maude

Ballis,

Brodo,

Falaschi

2024

Electronics

Self Cite

View full text Add to dashboard Cite

Reaction Systems (RSs) are a successful computational framework for modeling systems inspired by biochemistry. An RS defines a set of rules (reactions) over a finite set of entities (e.g., molecules, proteins, genes, etc.). A computation in this system is performed by rewriting a finite set of entities (a computation state) using all the enabled reactions in the RS, thereby producing a new set of entities (a new computation state). The number of entities in the reactions and in the computation states can be large, making the analysis of RS behavior difficult without a proper automated support. In this paper, we use the Maude language—a programming language based on rewriting logic—to define a formal executable semantics for RSs, which can be used to precisely simulate the system behavior as well as to perform reachability analysis over the system computation space. Then, by enriching the proposed semantics, we formalize a forward slicer algorithm for RSs that allows us to observe the evolution of the system on both the initial input and a fragment of it (the slicing criterion), thus facilitating the detection of forward causality and influence relations due to the absence/presence of some entities in the slicing criterion. The pursued approach is illustrated by a biological reaction system that models a gene regulation network for controlling the process of differentiation of T helper lymphocytes.

show abstract

Section: Discussionmentioning

confidence: 99%

Modeling and Analyzing Reaction Systems in Maude

Ballis,

Brodo,

Falaschi

2024

Electronics

Self Cite

View full text Add to dashboard Cite

show abstract

“…In rewriting logic, the work in [2] implements dynamic slicing for execution traces of the Maude model checker. The semantics is executed for an initial given state, then dependency relations are computed using a backward tracing mechanism.…”

Section: Related Workmentioning

confidence: 99%

Context-Updates Analysis and Refinement in Chisel

Asavoae

Asăvoae

Riesco

2018

Model Checking Software

View full text Add to dashboard Cite

This paper presents the context-updates synthesis component of Chisel-a tool that synthesizes a program slicer directly from a given algebraic specification of a programming language operational semantics. (By context-updates we understand programming language constructs such as goto instructions or function calls.) The context-updates synthesis follows two directions: an overapproximating phase that extracts a set of potential context-update constructs and an underapproximating phase that refines the results of the first step by testing the behaviour of the context-updates constructs produced at the previous phase. We use two experimental semantics that cover two types of language paradigms: high-level imperative and low-level assembly languages and we conduct the tests on standard benchmarks used in avionics.

show abstract

“…(a) O e does not equationally match the associated instance O(σ in σ out ) of the output template O; in this case, the slicing criterion is computed by applying the modular order-sorted least general generalization algorithm of [13] to gather up all of the mismatches (modulo the considered equational theory) between the erroneous canonical form O e and O(σ in σ out ) (see [20] for full details). (b) O e does equationally match O(σ in σ out ), but all of the corresponding matchers falsify the formula ϕ out ; in this case, the methodology proceeds analogously to case 1 (system assertions) and synthesizes the slicing criterion by examining the failing conjuncts of ϕ out systematically.…”

Section: Improving the Inference Of The Slicing Criteriamentioning

confidence: 99%

Debugging Maude programs via runtime assertion checking and trace slicing

Alpuente¹,

Ballis²,

Frechina³

et al. 2016

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

In this paper we propose a dynamic analysis methodology for improving the diagnosis of erroneous Maude programs. The key idea is to combine runtime checking and dynamic trace slicing for automatically catching errors at runtime while reducing the size and complexity of the erroneous traces to be analyzed (i.e., those leading to states failing to satisfy some of the assertions). First, we formalize a technique that is aimed at automatically detecting deviations of the program behavior (symptoms) with respect to two types of user-defined assertions: functional assertions and system assertions. The proposed dynamic checking is provably sound in the sense that all errors flagged are definitely violations of the specifications. Then, upon eventual assertion violations we generate accurate trace slices that help identify the cause of the error. Our methodology is based on (i) a logical notation for specifying assertions that are imposed on execution runs; (ii) a runtime checking technique that dynamically tests the assertions; and (iii) a mechanism based on (equational) least general generalization that automatically derives accurate criteria for slicing from falsified assertions. Finally, we report on an implementation of the proposed technique in the assertion-based, dynamic analyzer ABETS and show how the forward and backward tracking of asserted program properties leads to a thorough trace analysis algorithm that can be used for program diagnosis and debugging

show abstract

Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis

Cited by 7 publications

References 25 publications

Modeling and Analyzing Reaction Systems in Maude

Modeling and Analyzing Reaction Systems in Maude

Context-Updates Analysis and Refinement in Chisel

Debugging Maude programs via runtime assertion checking and trace slicing

Contact Info

Product

Resources

About