598 search results - page 41 / 120 » Generic Trace Theory |
ARESEC
2011
13 years 11 months ago
2011
—We formalise in a theorem prover the notion of provable anonymity proposed by Garcia et al. Our formalization relies on inductive definitions of message distinguish ability and...
114
click to vote
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
110
click to vote
TACS
2001
Springer
15 years 4 months ago
2001
Springer
Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel sy...
ENTCS
2008
14 years 12 months ago
2008
We recast Selinger's CPM-construction of completely positive maps [11] as an axiomatization of maximally mixed states. This axiomatization also guarantees categories of compl...
FUIN
2007
14 years 11 months ago
2007
Abstract. We review the characterization of communicating finite-state machines whose behaviors have universally or existentially bounded channels. These results rely on the theor...