Results 11  20
of
38
TomML: A Rule Language For Structured Data
"... We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting community. Tom bridges thus the gap between a general purpose language and high level specifications based on rewriting. This approach was motivated by the promotion of rule b ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting community. Tom bridges thus the gap between a general purpose language and high level specifications based on rewriting. This approach was motivated by the promotion of rule based techniques and their integration in large scale applications. Powerful matching capabilities along with a rich strategy language are among Tom’s strong features that make it easy to use and competitive with respect to other rule based languages. Tom is thus a natural choice for querying and transforming structured data and in particular XML documents [1]. We present here its main XML oriented features and illustrate its use on several examples.
Proof Search and Proof Check for Equational and Inductive Theorems
 Conference on Automated Deduction  CADE19
, 2003
"... Abstract. This paper presents ongoing researches on theoretical and practical issues of combining rewriting based automated theorem proving and userguided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof a ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. This paper presents ongoing researches on theoretical and practical issues of combining rewriting based automated theorem proving and userguided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check.
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
(Show Context)
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.
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
(Show Context)
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
Architectural Specification and Simulation Through RewritingLogic
 Colombian Journal of Computation
, 2003
"... In recent years Arvind’s Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specified by term rewriting systems are translated into a standard hardware description language for simulation purposes. In this ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
In recent years Arvind’s Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specified by term rewriting systems are translated into a standard hardware description language for simulation purposes. In this work we present our current investigation on the use of RewritingLogic, which is a more powerful theoretical framework than pure rewriting, for specification and verification of processor architectures at a higher abstraction level. We adopt the rewritinglogic environment ELAN to specify and verify architectures without the need to resort to the details of hardware description languages for simulation purposes. Our investigation shows that simulation at rewritinglogic level may provide useful insights to guide the architectural design.
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.
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
(Show Context)
Combination of approaches to the security of infinite states systems IN COLLABORATION WITH: Laboratoire lorrain de recherche en informatique et ses applications (LORIA), Laboratoire
A Generalization of Equational Proof Theory
"... Abstract. Recently rule based languages focussed on the use of rewriting as a modeling tool which results in making specications executable. To extend the modeling capabilities of rule based languages, we explored in a previous work the possibility of making the rule applications subject to probabi ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Recently rule based languages focussed on the use of rewriting as a modeling tool which results in making specications executable. To extend the modeling capabilities of rule based languages, we explored in a previous work the possibility of making the rule applications subject to probabilistic choices, and started to study the generalization of the results in the rewriting community about abstract reduction systems to systems with probabilistic choices. This paper presents a new contribution on this line by presenting a generalization of classical equational proof theory. We obtain a nice proof theory which is sound and complete, and which has initial models. 1
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 ..."
(Show Context)