Sciweavers

1679 search results - page 16 / 336
» Security Properties and CSP
Sort
View
SAC
2010
ACM
14 years 2 months ago
Relational consistency by constraint filtering
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
ECSQARU
2007
Springer
14 years 1 months ago
Algebraic Structures for Bipolar Constraint-Based Reasoning
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of evaluation of decisions are often bipolar. The aim of this ...
Hélène Fargier, Nic Wilson
ENTCS
2006
129views more  ENTCS 2006»
13 years 7 months ago
Confluence Thanks to Extensional Determinism
A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several p...
A. W. Roscoe
ENTCS
2006
145views more  ENTCS 2006»
13 years 7 months ago
A Classification of Time and/or Probability Dependent Security Properties
In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial studnformation ...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
CSFW
2009
IEEE
14 years 2 months ago
Modeling and Verifying Physical Properties of Security Protocols for Wireless Networks
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of phys...
Patrick Schaller, Benedikt Schmidt, David A. Basin...