Sciweavers

1679 search results - page 3 / 336
» Security Properties and CSP
Sort
View
AIMSA
2008
Springer
13 years 9 months ago
Interleaved Alldifferent Constraints: CSP vs. SAT Approaches
In this paper, we want to handle multiple interleaved Alldiff constraints from two points of view: a uniform propagation framework with some CSP reduction rules and a SAT encoding ...
Frédéric Lardeux, Eric Monfroy, Fr&e...
SAT
2007
Springer
92views Hardware» more  SAT 2007»
14 years 1 months ago
Mapping CSP into Many-Valued SAT
We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and p...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
CSFW
2005
IEEE
14 years 1 months ago
Temporal Rank Functions for Forward Secrecy
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
Rob Delicata, Steve A. Schneider
CSFW
2002
IEEE
14 years 17 days ago
Quantifying Information Flow
We extend definitions of information flow so as to quantify the amount of information passed; in other words, we give a formal definition of the capacity of covert channels. Ou...
Gavin Lowe
ENTCS
2006
133views more  ENTCS 2006»
13 years 7 months ago
Linking Semantic Models to Support CSP || B Consistency Checking
Consistency checking in the CSP B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outsid...
Neil Evans, Helen Treharne