15777 search results - page 2580 / 3156 » Software Engineering |
178
click to vote
FOSSACS
2004
Springer
16 years 13 days ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
191
click to vote
FOSSACS
2004
Springer
16 years 13 days 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...
233
click to vote
FOSSACS
2004
Springer
16 years 13 days 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...
172
click to vote
FOSSACS
2004
Springer
16 years 13 days 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...
162
click to vote
FOSSACS
2004
Springer
16 years 13 days 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...