Sciweavers

108 search results - page 22 / 22
» iandc 2006
Sort
View
IANDC
2006
77views more  IANDC 2006»
13 years 4 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
IANDC
2006
126views more  IANDC 2006»
13 years 4 months ago
Coalgebraic semantics for timed processes
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...
Marco Kick, John Power, Alex Simpson
IANDC
2006
121views more  IANDC 2006»
13 years 4 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton