Sciweavers

17 search results - page 2 / 4
» Automatic Compilation of Protocol Insecurity Problems into L...
Sort
View
PLDI
2006
ACM
13 years 11 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
CLIMA
2004
13 years 6 months ago
Verifying Protocol Conformance for Logic-Based Communicating Agents
Communication plays a fundamental role in multi-agents systems. One of the main issues in the design of agent interaction protocols is the verification that a given protocol implem...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
PADL
2009
Springer
14 years 5 months ago
Declarative Network Verification
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg So...
CSUR
1999
114views more  CSUR 1999»
13 years 4 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
CCS
2004
ACM
13 years 10 months ago
Verifying policy-based security for web services
WS-SecurityPolicy is a declarative configuration language for driving web services security mechanisms. We describe a formal sefor WS-SecurityPolicy, and propose a more abstract ...
Karthikeyan Bhargavan, Cédric Fournet, Andr...