15779 search results - page 2667 / 3156 » Change-oriented software engineering |
142
click to vote
FOSSACS
2004
Springer
15 years 9 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...
166
Voted
FOSSACS
2004
Springer
15 years 9 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...
121
click to vote
FOSSACS
2004
Springer
15 years 9 months ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
116
Voted
FOSSACS
2004
Springer
15 years 9 months ago
2004
Springer
This paper compares the expressiveness of ambient calculi against different dialects of the pi-calculus. Cardelli and Gordon encoded the asynchronous pi-calculus into their calcul...
139
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...