Sciweavers

ARESEC
2011
104views more  ARESEC 2011»
12 years 4 months ago
An Inductive Approach to Provable Anonymity
—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...
Yongjian Li, Jun Pang
TCS
2008
13 years 4 months ago
Decidability and syntactic control of interference
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...
James Laird
ENTCS
2007
72views more  ENTCS 2007»
13 years 4 months ago
Observational Equivalence for the Interaction Combinators and Internal Separation
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
Damiano Mazza
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 5 months ago
A Concrete Representation of Observational Equivalence for PCF
traction Problem for PCF Hyland-Ong games model Concrete Representation Compositional Semantics? A Concrete Representation of Observational Equivalence for PCF Martin Churchill, Ji...
Martin Churchill, James Laird, Guy McCusker
APLAS
2007
ACM
13 years 8 months ago
A Probabilistic Applied Pi-Calculus
Abstract. We propose an extension of the Applied Pi
Jean Goubault-Larrecq, Catuscia Palamidessi, Angel...
ICALP
1992
Springer
13 years 9 months ago
Barbed Bisimulation
This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence resu...
Robin Milner, Davide Sangiorgi
CCS
1998
ACM
13 years 9 months ago
A Probabilistic Poly-Time Framework for Protocol Analysis
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
Patrick Lincoln, John C. Mitchell, Mark Mitchell, ...
ICALP
2005
Springer
13 years 10 months ago
Idealized Algol with Ground Recursion, and DPDA Equivalence
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...
Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiew...
ICALP
2005
Springer
13 years 10 months ago
Decidability in Syntactic Control of Interference
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...
James Laird
CSFW
2009
IEEE
13 years 11 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune