4917 search results - page 766 / 984 » Software Engineering is Not Computer Science |
149
click to vote
FOSSACS
2004
Springer
15 years 12 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...
142
Voted
FOSSACS
2004
Springer
15 years 12 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...
178
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
166
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
161
click to vote
ICFEM
2004
Springer
15 years 12 months ago
2004
Springer
Reachability testing is a technique for testing concurrent programs. Reachability testing derives test sequences on-the-fly as the testing process progresses, and can be used to sy...