Strategies, model checking and branching-time properties in Maude

Rubio, Rubén García; Martí-Oliet, Narciso; Pita, Isabel; Verdejo, Alberto

doi:10.1016/j.jlamp.2021.100700

Cited by 18 publications

(5 citation statements)

References 78 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Once systems have been described in rewriting logic, verification and analysis become relevant. Testing and comparing specifications executed with alternative controlling strategies could provide interesting information, and verification techniques like model checking [47,52,50] have been developed for these systems. Quantitative extensions of the strategy language have also been implemented and applied for probabilistic and statistical model checking [46].…”

Section: Discussionmentioning

confidence: 99%

“…Notice that abstract strategies may also select infinite paths, which are useful in the specification of reactive systems, as described in [47,52,50].…”

Section: S(t)mentioning

confidence: 99%

“…Intermediate states are also interesting and relevant for some forms of analysis of the controlled systems like model checking. A similar operational semantics has been used to define model checking for such systems in [52,50]. Another advantage of the rewriting-based semantics is that it is executable and shows that the controlled system can be expressed in rewriting logic itself.…”

Section: N-completionmentioning

confidence: 99%

See 2 more Smart Citations

The Maude strategy language

Eker¹,

Martí-Oliet²,

Meseguer³

et al. 2023

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

Section: Discussionmentioning

confidence: 99%

“…Notice that abstract strategies may also select infinite paths, which are useful in the specification of reactive systems, as described in [47,52,50].…”

Section: S(t)mentioning

confidence: 99%

Section: N-completionmentioning

confidence: 99%

See 1 more Smart Citation

The Maude strategy language

Eker¹,

Martí-Oliet²,

Meseguer³

et al. 2023

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

“…With Maude, we can naturally define: (i) our transition functions, δ action and δ tick , and (ii) our transition system with rewriting rules mirroring our SOS. Such a transition system can then be executed and model checked using tools such as [12]. While our current work does not account for deontic inconsistencies, we aim to explore using such tools to detect them in the future.…”

Section: Transition System Semantics and Implementationmentioning

confidence: 99%

Deontics and Time in Contracts: An Executable Semantics for the L4 DSL

Watt,

Goodenough,

Wong

2023

Frontiers in Artificial Intelligence and Applications

View full text Add to dashboard Cite

Existing approaches to modelling contracts often rely on deontic logic to reason about norms, and only treat time qualitatively. Using L4, a textual domain specific language (DSL) for the law, we offer a more operational interpretation of norms, based on states and transitions, that also accounts for the granular timing of events. In this paper, we present a higher-level rendering of the loan agreement from Flood & Goodenough in L4, and an accompanying operational semantics amenable to execution and static analysis. We also implement this semantics in Maude and show how this lets us visualize the execution of the loan agreement.

show abstract

“…Some previous treatments of this problem in rewriting logic (Palomino et al . 2005;Rubio et al . 2021) used several rules to model the different ways of crossing.…”

mentioning

confidence: 99%

Compositional Verification in Rewriting Logic

MARTÍN,

VERDEJO,

MARTÍ-OLIET

2023

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on compositional verification. We show how the assume/guarantee technique can be transposed to our setting, by giving appropriate definitions of satisfaction based on transition structures and path semantics. We also show that simulation and equational abstraction can be done componentwise. Appropriate concepts of fairness and deadlock for our composition operation are discussed, as they affect satisfaction of temporal formulas. We keep in parallel a distributed and a global view of composed systems. We show that these views are equivalent and interchangeable, which may help our intuition and also has practical uses as, for example, it allows global-style verification of a modularly specified system. Under consideration in Theory and Practice of Logic Programming (TPLP).

show abstract

Strategies, model checking and branching-time properties in Maude

Cited by 18 publications

References 78 publications

The Maude strategy language

The Maude strategy language

Deontics and Time in Contracts: An Executable Semantics for the L4 DSL

Compositional Verification in Rewriting Logic

Contact Info

Product

Resources

About