Dynamic slicing of reaction systems based on assertions and monitors
Abstract Reaction Systems (RSs) are a successful computational framework inspired by
biological systems. RSs can involve a large number of reactions and entities, which makes it …
biological systems. RSs can involve a large number of reactions and entities, which makes it …
[HTML][HTML] Debugging Maude programs via runtime assertion checking and trace slicing
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 …
erroneous Maude programs. The key idea is to combine runtime checking and dynamic …
[HTML][HTML] Using conditional trace slicing for improving Maude programs
Understanding the behavior of software is important for the existing software to be improved.
In this paper, we present a trace slicing technique that is suitable for analyzing complex …
In this paper, we present a trace slicing technique that is suitable for analyzing complex …
A framework for monitored dynamic slicing of reaction systems
Reaction systems (RSs) are a computational framework inspired by biochemical
mechanisms. A RS defines a finite set of reactions over a finite set of entities. Typically each …
mechanisms. A RS defines a finite set of reactions over a finite set of entities. Typically each …
Causal analysis of positive Reaction Systems
Cause/effect analysis of complex systems is instrumental in better understanding many
natural phenomena. Moreover, formal analysis requires the availability of suitable abstract …
natural phenomena. Moreover, formal analysis requires the availability of suitable abstract …
A generic program slicing technique based on language definitions
A Riesco, IM Asăvoae, M Asăvoae - … 2012, Salamanca, Spain, June 7-10 …, 2013 - Springer
A formal executable semantics of a programming language has the necessary information to
develop program debugging and reasoning techniques. In this paper we choose such a …
develop program debugging and reasoning techniques. In this paper we choose such a …
A rewriting logic approach to the formal specification and verification of web applications
This paper develops a Rewriting Logic framework for the automatic specification and
verification of Web applications that considers the critical aspects of concurrent Web …
verification of Web applications that considers the critical aspects of concurrent Web …
Backward trace slicing for conditional rewrite theories
In this paper, we present a trace slicing technique for rewriting logic that is suitable for
analyzing complex, textually-large system computations in rewrite theories that may contain …
analyzing complex, textually-large system computations in rewrite theories that may contain …
Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJulienne
We present i Julienne, a trace analyzer for conditional rewriting logic theories that can be
used to compute abstract views of Maude executions that help users understand and debug …
used to compute abstract views of Maude executions that help users understand and debug …
Dynamic slicing for concurrent constraint languages
Abstract Concurrent Constraint Programming (CCP) is a declarative model for concurrency
where agents interact by telling and asking constraints (pieces of information) in a shared …
where agents interact by telling and asking constraints (pieces of information) in a shared …