Sciweavers

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
FOSSACS
2004
Springer
13 years 11 months ago
Intruder Theories (Ongoing Work)
Hubert Comon-Lundh
FOSSACS
2004
Springer
13 years 11 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
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
Pietro Di Gianantonio, Marino Miculan
FOSSACS
2004
Springer
13 years 10 months ago
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...
Pablo Giambiagi, Gerardo Schneider, Frank D. Valen...
Software Engineering
Top of PageReset Settings