Sciweavers

5084 search results - page 10 / 1017
» Proving Possibility Properties
Sort
View
CSFW
1995
IEEE
14 years 1 months ago
Composing and decomposing systems under security properties
We investigate the formal relationship between separability of processes and the types of non-interference properties they enjoy. Though intuitively appealing, separability – th...
A. W. Roscoe, L. Wulf
ISIPTA
1999
IEEE
134views Mathematics» more  ISIPTA 1999»
14 years 2 months ago
Conditional Independence Relations in Possibility Theory
The aim of this paper is to survey and brie y discuss various rules of conditioning proposed in the framework of possibility theory as well as various conditional independence rel...
Jirina Vejnarová
SYNTHESE
2008
71views more  SYNTHESE 2008»
13 years 9 months ago
Categories for the working mathematician: making the impossible possible
This paper discusses the notion of necessity in the light of results from contemporary mathematical practice. Two descriptions of necessity are considered. According to the first, ...
Jessica Carter
CSFW
2009
IEEE
14 years 4 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
FOSSACS
2004
Springer
14 years 1 months ago
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
Wan Fokkink, Sumit Nain