Sciweavers

30 search results - page 3 / 6
» Prototyping 3APL in the Maude term rewriting language
Sort
View
BIRTHDAY
2005
Springer
13 years 11 months ago
Term Rewriting Meets Aspect-Oriented Programming
We explore the connection between term rewriting systems (TRS) and aspect-oriented programming (AOP). Term rewriting is a paradigm that is used in fields such as program transform...
Paul Klint, Tijs van der Storm, Jurgen J. Vinju
FOSSACS
2004
Springer
13 years 11 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
EDOC
2004
IEEE
13 years 9 months ago
Formalizing ODP Computational Viewpoint Specifications in Maude
The ODP computational viewpoint describes the functionality of a system and its environment, in terms of a configuration of objects which interact at interfaces. Computational obj...
José Raúl Romero, Antonio Vallecillo
ENTCS
2008
96views more  ENTCS 2008»
13 years 5 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
RTA
2007
Springer
13 years 11 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...