ELAN from a rewriting logic point of view

Borovanský, Peter; Kirchner, Claude; Kirchner, Hélène; Moreau, Pierre-Étienne

doi:10.1016/s0304-3975(01)00358-9

Cited by 102 publications

(104 citation statements)

References 29 publications

Supporting

Mentioning

104

Contrasting

Order By: Relevance

“…(ismc [7] init |= exists F ( { 'reply : ('C \ 1) ; ('S \ 2) } AND F ( { 'rec : 'C \ 1 } AND X ( NOT ( value-is(1, f(2, 1, 7)))))) . )…”

Section: Faulty Channels Attackers and Cookiesmentioning

confidence: 99%

“…Stratego is a language for program transformation based on rewriting and strategies. ELAN, described for instance in [7], is a rewriting logic language. Both ELAN and Stratego have strategies included in the language, while in Maude system modules and strategy modules are separated syntactic entities.…”

Section: Strategiesmentioning

confidence: 99%

“…Strategies [11,24,7,19], applied to system specifications, are a means of guiding their evolution and restricting their nondeterminism. There exists a rich strategy language for Maude.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

“…(ismc [7] init |= exists F ( { 'reply : ('C \ 1) ; ('S \ 2) } AND F ( { 'rec : 'C \ 1 } AND X ( NOT ( value-is(1, f(2, 1, 7)))))) . )…”

Section: Faulty Channels Attackers and Cookiesmentioning

confidence: 99%

Section: Strategiesmentioning

confidence: 99%

See 1 more Smart Citation

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

show abstract

“…Indeed, there are several rewriting logic language implementations, including CafeOBJ [11], ELAN [3], and Maude [7,8]. Rewriting logic then has inference rules to infer all the possible concurrent computations in a system [16,4], in the sense that, given two states…”

Section: Rewriting Logicmentioning

confidence: 99%

Theoroidal Maps as Algebraic Simulations

Martí-Oliet

Meseguer

Palomino

2005

Recent Trends in Algebraic Development Techniques

View full text Add to dashboard Cite

Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framework in which to formally specify these mathematical models, and introduce a particular and elegant way of representing simulations in it: theoroidal maps. A categorical viewpoint is very natural in the study of these structures and we show how to organize Kripke structures in categories that afterwards are lifted to the rewriting logic's level. We illustrate the use of theoroidal maps with two applications: predicate abstraction and the study of fairness constraints.

show abstract

“…For example, in rule-based languages such as ASF+SDF [8], Elan [9], OBJ [18], CafeOBJ [14], and Maude [11] some function symbols may be declared to obey given algebraic laws (the so-called equational attributes of OBJ, CafeOBJ and Maude), whose effect is to compute with equivalence classes modulo such axioms while avoiding the risk of non-termination. Similarly, theorem provers, both general first-order logic ones and inductive theorem provers, routinely support commonly occurring equational theories for some function symbols such as associativity-commutativity.…”

Section: Introductionmentioning

confidence: 99%

A Modular Equational Generalization Algorithm

Alpuente

Escobar

Meseguer

et al. 2009

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

Abstract. This paper presents a modular equational generalization algorithm, where function symbols can have any combination of associativity, commutativity, and identity axioms (including the empty set). This is suitable for dealing with functions that obey algebraic laws, and are typically mechanized by means of equational atributes in rule-based languages such as ASF+SDF, Elan, OBJ, Cafe-OBJ, and Maude. The algorithm computes a complete set of least general generalizations modulo the given equational axioms, and is specified by a set of inference rules that we prove correct. This work provides a missing connection between least general generalization and computing modulo equational theories, and opens up new applications of generalization to rule-based languages, theorem provers and program manipulation tools such as partial evaluators, test case generators, and machine learning techniques, where function symbols obey algebraic axioms. A Web tool which implements the algorithm has been developed which is publicly available.

show abstract

ELAN from a rewriting logic point of view

Cited by 102 publications

References 29 publications

Model Checking TLR* Guarantee Formulas on Infinite Systems

Model Checking TLR* Guarantee Formulas on Infinite Systems

Theoroidal Maps as Algebraic Simulations

A Modular Equational Generalization Algorithm

Contact Info

Product

Resources

About