A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting

Bae, Kyungmin; Meseguer, José

doi:10.1016/j.entcs.2012.11.009

Cited by 22 publications

(26 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One can distinguish two main camps in temporal logic and model checking [5]: the state-based approach, in which all atoms in formulas are state predicates (e.g., LTL, CTL, and CTL * [6]); and the event-based approach, where the formulas' atoms are actions or events (e.g., A-CTL [7]). At the semantic level, state based formulas are evaluated on Kripke structures, whereas action-based formulas are evaluated on labeled transition systems.…”

Section: Our Approachmentioning

confidence: 99%

A rewriting logic approach to the formal specification and verification of web applications

Alpuente

Ballis

Romero

2014

Science of Computer Programming

View full text Add to dashboard Cite

This paper develops a Rewriting Logic framework for the automatic specification and verification of Web applications that considers the critical aspects of concurrent Web interactions, browser navigation features (e.g., forward/backward navigation, page refresh, and new window/tab opening), and Web script evaluation. By encompassing the main features of the most popular Web scripting languages (e.g., PHP, ASP, and Java Servlets), our scripting language is powerful enough to model the dynamics of complex Web applications, where the interactions among Web servers and Web browsers are formalized through a landmark communicating protocol that abstracts HTTP. We provide a detailed characterization of browser actions via rewrite rules and show how our models can be naturally model-checked by using the Linear Temporal Logic of Rewriting (LTLR), which is a Linear Temporal Logic that is specifically designed for model-checking rewrite theories. The framework has been completely implemented in Maude, and we report on some successful experiments that we conducted using the Maude LTLR model-checker.

show abstract

Section: Our Approachmentioning

confidence: 99%

A rewriting logic approach to the formal specification and verification of web applications

Alpuente

Ballis

Romero

2014

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…The papers [6,3,4,5] are all related to model checking Maude modules with LTLR formulas. The logic LTLR is the linear sublogic of TLR*, that is, formulas with no path quantifiers taken to be universally quantified on paths.…”

Section: Chaptermentioning

confidence: 99%

“…In [6] the authors implement a translation, already described in [21], that allows the use of Maude's LTL model checker. The idea is the following: We are given a rewriting system R, with an initial state on it, and an LTLR formula as parameters to perform model checking on them.…”

Section: Chaptermentioning

confidence: 99%

Model Checking TLR* Guarantee Formulas on Infinite Systems

Martín

Verdejo

Martí-Oliet

2014

Specification, Algebra, and Software

View full text Add to dashboard Cite

Autorización de difusiónEl abajo firmante, matriculado en el Máster en Investigación en Informática de la Facultad de Informática, autoriza a la Universidad Complutense de Madrid (UCM) a difundir y utilizar con fines académicos, no comerciales y mencionando expresamente a su autor el presente Trabajo de Fin de Máster: "Model Checking TLR* Guarantee Formulas on Infinite Systems", realizado durante el curso académico 2012-2013 bajo la dirección de Alberto Verdejo y Narciso Martí en el Departamento de Sistemas Informáticos y Computación, y a la Biblioteca de la UCM a depositarlo en el Archivo Institucional EPrints Complutense con el objeto de incrementar la difusión, uso e impacto del trabajo en Internet y garantizar su preservación y acceso a largo plazo. Óscar Martín Julio de 2013 i ii ResumenPresentamos la implementación de un model checker para sistemas con una cantidad de estados potencialmente infinita. Se ha desarrollado sobre el lenguaje y el sistema Maude, basado en lógica de reescritura. Los sistemas que se quieran analizar también han de estar especificados como módulos Maude. El model checker funciona con estados explícitos. Así, en sistemas infinitos, no podemos esperar que la comprobación acabe en todos los casos. De hecho, solo proporciona un semi-algoritmo para validar fórmulas de garantía (o, equivalentemente, para invalidar fórmulas de seguridad). Para evitar entrar en caminos infinitos, las búsquedas siempre se llevan a cabo con profundidad acotada.La lógica temporal que usamos es TLR* (Temporal Logic of Rewriting). Esta lógica es una generalización de CTL* que usa proposiciones atómicas no solo sobre estados, sino también sobre transiciones, proporcionando así una mayor potencia expresiva. Como paso intermedio, presentamos un lenguaje de estrategias para Maude. Las fórmulas de garantía se traducen primero a expresiones de estrategia y, entonces, se hace evolucionar en paralelo al sistema y a la estrategia para buscar cómputos que satisfagan la estrategia y, por tanto, la fórmula.Se incluyen varios ejemplos para mostrar la utilidad de nuestra herramienta. En particular, se presenta un ejemplo más largo, relativo a protocolos de coherencia de caché.Las tres ideas en las que se basa este trabajo -el model checker, TLR* y el lenguaje de estrategias-son propuestas tomadas de [21]. Palabras claveSistema de infinitos estados, lógica de reescritura, Maude, model checking, estrategia, lógica temporal, TLR*, fórmula de garantía, protocolo de coherencia de caché.iii iv AbstractWe present the implementation of a model checker for systems with a potentially infinite number of states. It has been developed in the rewriting-logic language and system Maude. The systems to be analysed need also be specified as Maude modules. The model checker is explicit-state, that is, not symbolic. Thus, in infinite systems, we cannot expect it to finish in every case. Indeed, it only provides a semi-decision algorithm to validate guarantee formulas (or, equivalently, to falsify safety ones). To avoid getting lost in infinite ...

show abstract

“…We recall that the state of the system under study is described by the state vector X = (X1, ..., Xn), with state space D = D1 ×⋯× Dn ⊆ R n , where each variable Xi ∈ Di ⊆ R. Given, a model (M, G, V), SSTL formulae are evaluated over real valued traces ⃗ x ∶ T×L → D, generated by simulating the model 3 , where T is the time set and L is the set of locations. We write …”

Section: Signal Spatio-temporal Logicmentioning

confidence: 99%

“…While spatial and spatio-temporal logics have been proposed and theoretically investigated in literature [1], model checking routines have a much more recent history. Relevant works are those on spatial logics for process algebra with locations as [12,30], or spatial logic for rewrite theories [3]. Other relevant literature on purely spatial logic is [13,23].…”

Section: Introductionmentioning

confidence: 99%

Specifying and Monitoring Properties of Stochastic Spatio-Temporal Systems in Signal Temporal Logic

Bortolussi¹,

Nenzi²

2015

Proceedings of the 8th International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

We present an extension of the linear time, time-bounded, Signal Temporal Logic to describe spatio-temporal properties. We consider a discrete location/ patch-based representation of space, with a population of interacting agents evolving in each location and with agents migrating from one patch to another one. We provide both a boolean and a quantitative semantics to this logic. We then present monitoring algorithms to check the validity of a formula, or to compute its satisfaction (robustness) score, over a spatiotemporal trace, exploiting these routines to do statistical model checking of stochastic models. We illustrate the logic at work on an epidemic example, looking at the diffusion of a cholera infection among communities living along a river.

show abstract

A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting

Cited by 22 publications

References 22 publications

A rewriting logic approach to the formal specification and verification of web applications

A rewriting logic approach to the formal specification and verification of web applications

Model Checking TLR* Guarantee Formulas on Infinite Systems

Specifying and Monitoring Properties of Stochastic Spatio-Temporal Systems in Signal Temporal Logic

Contact Info

Product

Resources

About