Sciweavers

FOSSACS
2009
Springer
13 years 11 months ago
Beyond Shapes: Lists with Ordered Data
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...
Kshitij Bansal, Rémi Brochenin, Étie...
FOSSACS
2009
Springer
13 years 11 months ago
On the Foundations of Quantitative Information Flow
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. ...
Geoffrey Smith
FOSSACS
2009
Springer
13 years 11 months ago
Realizability of Concurrent Recursive Programs
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...
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habe...
FOSSACS
2009
Springer
13 years 11 months ago
Normal Bisimulations in Calculi with Passivation
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...
Sergueï Lenglet, Alan Schmitt, Jean-Bernard S...
FOSSACS
2009
Springer
13 years 11 months ago
Full Abstraction for Reduced ML
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...
Andrzej S. Murawski, Nikos Tzevelekos