138
Voted
FOSSACS
15 years 6 months ago
2004 Springer 
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...
127
Voted
FOSSACS
15 years 4 months ago
2004 Springer 
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...
112
Voted
FOSSACS
15 years 6 months ago
2004 Springer
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...
110
Voted
FOSSACS
15 years 6 months ago
2004 Springer 
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...
105
Voted
FOSSACS
15 years 6 months ago
2004 Springer
We describe a game semantics for local names in a functional setting. It is based on a category of dialogue games acted upon by the automorphism group of the natural numbers; this ...
|
Software Engineering