Sciweavers

FOSSACS
2004
Springer
15 years 3 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
15 years 1 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...
FOSSACS
2004
Springer
15 years 3 months ago
Strong Bisimulation for the Explicit Fusion Calculus
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
Lucian Wischik, Philippa Gardner
FOSSACS
2004
Springer
15 years 3 months ago
Adhesive Categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in comput...
Stephen Lack, Pawel Sobocinski
FOSSACS
2004
Springer
15 years 3 months ago
Angelic Semantics of Fine-Grained Concurrency
We introduce a game model for an Algol-like programming language with primitives for parallel composition and synchronization on semaphores. The semantics is based on a simplifie...
Dan R. Ghica, Andrzej S. Murawski
Software Engineering
Top of PageReset Settings