11 search results - page 2 / 3 » fossacs 2001 |
FOSSACS
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...
FOSSACS
2001
Springer
13 years 10 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...
FOSSACS
2001
Springer
13 years 10 months ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
FOSSACS
2010
Springer
14 years 12 days ago
2010
Springer
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
LICS
2010
IEEE
13 years 4 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...