Sciweavers

FOSSACS
2004
Springer
13 years 10 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
FOSSACS
2004
Springer
13 years 10 months ago
Reasoning about Dynamic Policies
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the w...
Riccardo Pucella, Vicky Weissman
FOSSACS
2004
Springer
13 years 10 months ago
Intruder Theories (Ongoing Work)
Hubert Comon-Lundh
FOSSACS
2004
Springer
13 years 10 months ago
On Term Rewriting Systems Having a Rational Derivation
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
Antoine Meyer
FOSSACS
2004
Springer
13 years 10 months ago
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
Hartmut Ehrig, Barbara König
Software Engineering
Top of PageReset Settings