Results 11 
19 of
19
A provably correct compiler for efficient model checking of mobile processes
 In Proceedings of PADL
, 2005
"... Abstract. We present an optimizing compiler for the πcalculus that significantly improves the time and space performance of the MMC model checker. MMC exploits the similarity between the manner in which resolution techniques handle variables in a logic program and the manner in which the operationa ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. We present an optimizing compiler for the πcalculus that significantly improves the time and space performance of the MMC model checker. MMC exploits the similarity between the manner in which resolution techniques handle variables in a logic program and the manner in which the operational semantics of the πcalculus handles names by representing πcalculus names in MMC as Prolog variables, with distinct names represented by distinct variables. Given a πcalculus process P, our compiler for MMC produces an extremely compact representation of P ’s symbolic state space as a set of transition rules. ItalsousesAC unification to recognize states that are equivalent due to symmetry.
The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology System Demonstration
 Proceedings: 2nd International Workshop on Language Descriptions, Tools and Applications, volume 65. Electronic Notes in Theoretical Computer Science
, 2002
"... Introduction ELAN [10,3] is a specification language based on rewriting logic [9,12]. Some of the characteristic features of ELAN are rewriting, ACmatching, and strategies to control the nondeterminism induced by nonconfluent rewrite systems. Hence, ACmatching and strategies are two sources of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Introduction ELAN [10,3] is a specification language based on rewriting logic [9,12]. Some of the characteristic features of ELAN are rewriting, ACmatching, and strategies to control the nondeterminism induced by nonconfluent rewrite systems. Hence, ACmatching and strategies are two sources of nondeterminism. The specificity of ELAN consists of integrating the two forms of nondeterminism plus deterministic rulebased computations in the same environment. The development of ELAN specifications is supported by an environment which contains, among others, a parser, an interpreter [10], and a compiler [14,11]. This environment can be characterized as command line based. ELAN specifications were developed using standard editors and given to the environment for compilation or interpretation via the command line. The current version of the ELAN compiler [11] is independent Email: Mark.van.den.Brand@cwi.nl, vandenbr@loria.fr Email: moreau@loria.fr Email: ringeiss@loria.fr c 20
Operational termination of conditional rewriting with builtin numbers and semantic data structures
, 2007
"... Abstract. Rewrite systems on free data structures have limited expressive power since semantic data structures like sets or multisets cannot be modeled elegantly. In this work we define a class of rewrite systems that allows the use of semantic data structures. Additionally, builtin natural numbers ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Rewrite systems on free data structures have limited expressive power since semantic data structures like sets or multisets cannot be modeled elegantly. In this work we define a class of rewrite systems that allows the use of semantic data structures. Additionally, builtin natural numbers, including (dis)equality, ordering, and divisibility constraints, are supported. The rewrite mechanism is a combination of normalized equational rewriting with evaluation of conditions and validity checking of instantiated constraints. The framework is highly expressive and allows modeling of algorithms in a natural way. Termination is one of the most important properties of conditional normalized equational rewriting. For this it is not sufficient to only show wellfoundedness of the rewrite relation, but it also has to be ensured that evaluation of the conditions does not loop. The notion of operational termination is a way to capture these properties. In this work we show that it is possible to transform a conditional constrained equational rewrite system into an unconditional one such that termination of the latter implies operational termination of the former. Methods for showing termination of unconditional constrained equational rewrite system are presented in a companion paper. 1
Experiments with an Implementation of Extended Narrowing and Resolution in the Rewriting Language ELAN
, 2000
"... We describe an implementation of Extended Narrowing and Resolution, an inference system that integrates constrained resolution and narrowing on propositions. It is written in the rewriting language ELAN, which allows to use a natural presentation of data structures, e.g. sets as a union modulo AC of ..."
Abstract
 Add to MetaCart
We describe an implementation of Extended Narrowing and Resolution, an inference system that integrates constrained resolution and narrowing on propositions. It is written in the rewriting language ELAN, which allows to use a natural presentation of data structures, e.g. sets as a union modulo AC of singletons. Nevertheless, by using the new ELAN compiler we obtain speeds that are sufficient to conduct meaningful experiments. As an example we have looked at problems from set theory.
LDTA'02 Preliminary Version
, 2002
"... Introduction ELAN [10,3] is a specification language based on rewriting logic [9,12]. Some of the characteristic features of ELAN are rewriting, ACmatching, and strategies to control the nondeterminism induced by nonconfluent rewrite systems. Hence, ACmatching and strategies are two sources of ..."
Abstract
 Add to MetaCart
Introduction ELAN [10,3] is a specification language based on rewriting logic [9,12]. Some of the characteristic features of ELAN are rewriting, ACmatching, and strategies to control the nondeterminism induced by nonconfluent rewrite systems. Hence, ACmatching and strategies are two sources of nondeterminism. The specificity of ELAN consists of integrating the two forms of nondeterminism plus deterministic rulebased computations in the same environment. The development of ELAN specifications is supported by an environment which contains, among others, a parser, an interpreter [10], and a compiler [14,11]. This environment can be characterized as command line based. ELAN specifications were developed using standard editors and given to the environment for compilation or interpretation via the command line. The current version of the ELAN compiler [11] is independent Email: Mark.van.den.Brand@cwi.nl, vandenbr@loria.fr Email: moreau@loria.fr Email: ringeiss@loria.fr This
Using Rewriting Logic To Generate Different Implementations Of
, 2006
"... A novel toolflow based in rewritinglogic is used to automatically generate polynomial approximations for arbitrary continous functions. The simple but powerful semantics of rewriting logic provide a natural mechanism for manipulating algebraic expressions, allowing the development to be done on a h ..."
Abstract
 Add to MetaCart
A novel toolflow based in rewritinglogic is used to automatically generate polynomial approximations for arbitrary continous functions. The simple but powerful semantics of rewriting logic provide a natural mechanism for manipulating algebraic expressions, allowing the development to be done on a higher abstraction level while avoiding the unnecessary semantics required in hardware description and programming languages. The resulting polynomial approximations are rewritten to generate alternative implementation approaches which are automatically converted into different functionally equivalent hardware implementations. The rewritinglogic toolflow can generate implementations for both fine and coarsegrained architectures. This paper presents the implementation results for the Pact XPP coarsegrained reconfigurable architecture.
ProjectTeam PROTHEO Constraints, Mechanized Deduction and Proofs of Software Properties
"... c t i v it y e p o r t 2007 Table of contents ..."
THEME Programs, Verification and ProofsTable of contents
"... Combination of approaches to the security of infinite states systems IN COLLABORATION WITH: Laboratoire lorrain de recherche en informatique et ses applications (LORIA), Laboratoire ..."
Abstract
 Add to MetaCart
Combination of approaches to the security of infinite states systems IN COLLABORATION WITH: Laboratoire lorrain de recherche en informatique et ses applications (LORIA), Laboratoire