FOSSACS
2009
Springer
14 years 7 months ago
2009
Springer
FOSSACS
2009
Springer
14 years 7 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
FOSSACS
2009
Springer
14 years 7 months ago
2009
Springer
There is growing interest in quantitative theories of information flow in a variety of contexts, such as secure information flow, anonymity protocols, and side-channel analysis. ...
FOSSACS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
FOSSACS
2009
Springer
14 years 7 months ago
2009
Springer
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterization...
FOSSACS
2009
Springer
14 years 7 months ago
2009
Springer
traction for Reduced ML Andrzej S. Murawski and Nikos Tzevelekos Oxford University Computing Laboratory Wolfson Building, Parks Road, Oxford OX1 3QD, UK We present the first effe...
BIRTHDAY
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
BIRTHDAY
2009
Springer
14 years 7 months ago
2009
Springer
BIRTHDAY
2009
Springer
14 years 7 months ago
2009
Springer
Research into embedded sensor networks has placed increased focus on the problem of developing reliable and flexible software for microcontroller-class devices. Languages such as ...
BIRTHDAY
2009
Springer
14 years 7 months ago
2009
Springer
We propose a naive version of action semantics that begins with a selection of “transient” and “persistent” facets, each characterized as a partial monoid. Yielders are de...