Sciweavers

882 search results - page 28 / 177
» A Taste of Rewrite Systems
Sort
View
BIRTHDAY
2005
Springer
14 years 1 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
IANDC
2008
131views more  IANDC 2008»
13 years 7 months ago
Termination of just/fair computations in term rewriting
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
Salvador Lucas, José Meseguer
ICLP
1997
Springer
13 years 11 months ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
CSB
2005
IEEE
163views Bioinformatics» more  CSB 2005»
14 years 1 months ago
A symbolic approach to the simulation of biochemical models: application to circadian rhythms
Symbolic rewriting systems are gaining interest as tools for simulating biochemical dynamics. Compared to traditional methods based on differential equations, the symbolic approac...
Federico Fontana, Luca Bianco, Vincenzo Manca
CCS
2005
ACM
14 years 1 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet