16725 search results - page 2801 / 3345 » Engineering Software Correctness |
132
click to vote
FOSSACS
2004
Springer
16 years 11 days ago
2004
Springer
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...
176
click to vote
FOSSACS
2004
Springer
16 years 11 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...
227
click to vote
FOSSACS
2004
Springer
16 years 11 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...
169
click to vote
FOSSACS
2004
Springer
16 years 11 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...
156
click to vote
FOSSACS
2004
Springer
16 years 11 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...