AbstractWe propose generic invariant-driven strategies that control the execution of systems by guaranteeing that the given invariants are satisfied. Our strategies are generic in the sense that they are parameterized by the system whose execution they control, by the logic in which the invariants are expressed, and by the invariants themselves. We illustrate the use of the strategies in the case of invariants expressed in propositional logic. However, the good properties of Maude as a logical and semantic framework, in which many different logics and formalisms can be expressed and executed allow us to use other logics as parameter of our strategies
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
Rewriting is a formalism widely used in computer science and mathematical logic. When using rewritin...
Maude is a high-level language and a high-performance system supporting executable specification and...
AbstractWe propose generic invariant-driven strategies that control the execution of systems by guar...
AbstractThis paper is an introduction to rule-based programming in Maude. We illustrate in particula...
AbstractWe describe a first proposal for a strategy language for Maude, to control the rewriting pro...
AbstractMaude is a high-level language and a high-performance system supporting executable specifica...
International audienceWe present an approach for verifying dynamic systems specified in rewriting lo...
AbstractThis paper describes in detail how to bridge the gap between theory and practice in a new im...
AbstractThis paper describes in detail how to bridge the gap between theory and practice when implem...
Intuitively, a strategy language is a way of taming the nondeterminism of a rewrite theory. We can t...
We present an approach based on inductive theorem proving for verifying invariance properties of sys...
AbstractMaude is a high-level language and a high-performance system supporting executable specifica...
In this paper, we present \atame, an assertion-based program specialization tool for the multi-parad...
[ES] El objetivo de este trabajo es formalizar un mecanismo general para garantizar la seguridad de ...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
Rewriting is a formalism widely used in computer science and mathematical logic. When using rewritin...
Maude is a high-level language and a high-performance system supporting executable specification and...
AbstractWe propose generic invariant-driven strategies that control the execution of systems by guar...
AbstractThis paper is an introduction to rule-based programming in Maude. We illustrate in particula...
AbstractWe describe a first proposal for a strategy language for Maude, to control the rewriting pro...
AbstractMaude is a high-level language and a high-performance system supporting executable specifica...
International audienceWe present an approach for verifying dynamic systems specified in rewriting lo...
AbstractThis paper describes in detail how to bridge the gap between theory and practice in a new im...
AbstractThis paper describes in detail how to bridge the gap between theory and practice when implem...
Intuitively, a strategy language is a way of taming the nondeterminism of a rewrite theory. We can t...
We present an approach based on inductive theorem proving for verifying invariance properties of sys...
AbstractMaude is a high-level language and a high-performance system supporting executable specifica...
In this paper, we present \atame, an assertion-based program specialization tool for the multi-parad...
[ES] El objetivo de este trabajo es formalizar un mecanismo general para garantizar la seguridad de ...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
Rewriting is a formalism widely used in computer science and mathematical logic. When using rewritin...
Maude is a high-level language and a high-performance system supporting executable specification and...