Specification and proof in membership equational logic

Bouhoula, Adel; Jouannaud, Jean-Pierre; Meseguer, José

doi:10.1007/bfb0030589

Cited by 68 publications

(124 citation statements)

References 20 publications

(20 reference statements)

Supporting

Mentioning

123

Contrasting

Order By: Relevance

“…Checking for inclusion in protected mode for any two given (general) equational theories requires theorem proving [4]. Our case has a simple solution: we only need to ensure uniqueness of model element identifiers considering that transformation from UML+OCL to equational theories defined in [10] has the Church-Rosser property, that is, each model element has a single canonical form in the generated equational theory.…”

Section: Querytheory(od E) Queryterm(e) = Asterm(v)mentioning

confidence: 99%

“…More precisely, the approach taken in [13] produces theories in membership equational logic [4], which is a generalization of equational logic that allows for the specification of membership equations. 2 A membership equation specifies when a given term t has a given sort S. Such equations may also be conditional.…”

Section: An Algebraic Interpretation Of the Merged Metamodel And Tranmentioning

confidence: 99%

See 1 more Smart Citation

A transformation contract to generate aspects from access control policies

Braga

2010

Softw Syst Model

View full text Add to dashboard Cite

Access control is an important security issue. It has been addressed since the late 1960s in the early timesharing computer systems. Many access control models have been proposed since than but of particular interest is Ferraiolo and Khun's role-based access control model (RBAC). It is a simple and yet general model which has been deeply studied and applied both in industry and in academia. A variety of industrial standards have been proposed based on this model. Generating code for an access control policy is an interesting challenge. Understanding access control as a nonfunctional concern that cross-cuts the functional part of a system raises difficulties quite suitable for a solution based on aspect-oriented programming. In this paper, we address the problems of specification and validation of code generation for access control policies targeting an aspect-based infrastructure. We propose an MDA approach. The code generator is a transformation from SecureUML, an RBAC-based modeling language, to the language Aspects for Access Control (AAC), an aspect-oriented modeling language proposed in this paper. Metamodels are used to represent the languages and to specify the transformation. A metamodel is used to represent the abstract syntax of a language and the constraints that a given instance model of the metamodel must fulfill. This paper is dedicated with affection to the memory of Vinicius Braga. Communicated byWe also use a metamodel to specify the code generator. This transformation metamodel, together with all the constraints, that is, from both languages and those constraints regarding the merge of the two languages, we call a transformation contract. It merges and conservatively extends the source and target metamodels of the model transformation it represents. In the context of code-generation for access control policies, the transformation contract specifies the relationships between the abstract syntaxes of SecureUML and AAC and constrains the two languages. The validation of the code generator also uses the transformation contract. For a given access control policy and aspect, represented as instances of the appropriate metamodels, with aspects produced by the code generator, the constraints of the transformation contract must hold. We have prototyped a transformer from Secure-UML to aspects on top of ITP/OCL, an OCL interpreter that automatically validates the generated aspect code by applying the constraints of the transformation contract.

show abstract

Section: Querytheory(od E) Queryterm(e) = Asterm(v)mentioning

confidence: 99%

Section: An Algebraic Interpretation Of the Merged Metamodel And Tranmentioning

confidence: 99%

A transformation contract to generate aspects from access control policies

Braga

2010

Softw Syst Model

View full text Add to dashboard Cite

show abstract

“…We only recall those MEL notions which are necessary for understanding this paper; the interested reader is referred to Meseguer (1998), Bouhoula et al (2000) for a comprehensive exposition of MEL.…”

Section: Membership Equational Logicmentioning

confidence: 99%

Rewriting-Based Techniques for Runtime Verification

2005

View full text Add to dashboard Cite

Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are infinite traces, finite traces appear naturally when testing and/or monitoring real applications that only run for limited time periods. A finite trace variant of LTL is formally defined, together with an immediate executable semantics which turns out to be quite inefficient if used directly, via rewriting, as a monitoring procedure. Then three algorithms are investigated. First, a simple synthesis algorithm for monitors based on dynamic programming is presented; despite the efficiency of the generated monitors, they unfortunately need to analyze the trace backwards, thus making them unusable in most practical situations. To circumvent this problem, two rewriting-based practical algorithms are further investigated, one using rewriting directly as a means for online monitoring, and the other using rewriting to generate automata-like monitors, called binary transition tree finite state machines (and abbreviated BTT-FSMs). Both rewriting algorithms are implemented in Maude, an executable specification language based on a very efficient implementation of term rewriting. The first rewriting algorithm essentially consists of a set of equations establishing an executable semantics of LTL, using a simple formula transforming approach. This algorithm is further improved to build automata on-the-fly via caching and reuse of rewrites (called memoization), resulting in a very efficient and small Maude program that can be used to monitor program executions. The second rewriting algorithm builds on the first one and synthesizes provably minimal BTT-FSMs from LTL formulae, which can then be used to analyze execution traces online without the need for a rewriting system. The presented work is part of an ambitious runtime verification and monitoring project at NASA Ames, called PATHEXPLORER, and demonstrates that rewriting can be a tractable and attractive means for experimenting and implementing logics for program monitoring.

show abstract

“…For this to be meaningful, the variables in the righthand side of an equation have to be included among those in the lefthand side (a generalization is provided by means of matching equations in conditions, as we will see later); moreover, the set of equations must be terminating and confluent. This guarantees that all terms will simplify to a unique canonical form [1]. Some equations, like commutativity, are not terminating, but nonetheless they are supported by means of operator attributes, so that Maude performs simplification modulo the equational theories provided by such attributes, that can be associativity, commutativity, identity, and idempotence.…”

Section: Functional Modulesmentioning

confidence: 98%

A Tutorial on Specifying Data Structures in Maude

Martí-Oliet

Palomino

Verdejo

2005

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

This tutorial describes the equational specification of a series of typical data structures in Maude. We start with the well-known stacks, queues, and lists, to continue with binary and search trees. Not only are the simple versions considered but also advanced ones such as AVL and 2-3-4 trees. The operator attributes available in Maude allow the specification of data based on constructors that satisfy some equational properties, like concatenation of lists which is associative and has the empty list as identity, as opposed to the free constructors available in other functional programming languages. Moreover, the expressive version of equational logic in which Maude is based, namely membership equational logic, allows the faithful specification of types whose data are defined not only by means of constructors, but also by the satisfaction of additional properties, like sorted lists or search trees. In the second part of the paper we describe the use of an inductive theorem prover, the ITP, which itself is developed and integrated in Maude by means of the powerful metalevel and metalanguage features offered by the latter, to prove properties of the data structures. This is work in progress because the ITP is still under development and, as soon as the data gets a bit complex, the proof of their properties gets even more complex.

show abstract

Specification and proof in membership equational logic

Cited by 68 publications

References 20 publications

A transformation contract to generate aspects from access control policies

A transformation contract to generate aspects from access control policies

Rewriting-Based Techniques for Runtime Verification

A Tutorial on Specifying Data Structures in Maude

Contact Info

Product

Resources

About