Sciweavers

882 search results - page 63 / 177
» A Taste of Rewrite Systems
Sort
View
ICNP
1998
IEEE
13 years 12 months ago
Distributed Packet Rewriting and its Application to Scalable Server Architectures
To construct high performance Web servers, system builders are increasingly turning to distributed designs. An important challenge that arises in such designs is the need to direc...
Azer Bestavros, Mark Crovella, Jun Liu, David Mart...
BDA
2007
13 years 9 months ago
Query Rewriting Based on User's Profile Knowledge
Query personalization was introduced as an advanced mechanism to allow the reformulation of database queries and adapt them to the user's domain of interest and preferences. ...
Dimitre Kostadinov, Mokrane Bouzeghoub, Sté...
RTA
2009
Springer
14 years 2 months ago
VMTL-A Modular Termination Laboratory
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
Felix Schernhammer, Bernhard Gramlich
DANCE
2002
IEEE
14 years 19 days ago
Maude as a Wide-Spectrum Framework for Formal Modeling and Analysis of Active Networks
Modeling and formally analyzing active network systems and protocols is quite challenging, due to their highly dynamic nature and the need for new network models. We propose a wid...
José Meseguer, Peter Csaba Ölveczky, M...
RTA
2010
Springer
13 years 11 months ago
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
Takahito Aoto