Sciweavers

713 search results - page 127 / 143
» Model Checking and Transitive-Closure Logic
Sort
View
AAAI
2006
15 years 15 hour ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez
CORR
2008
Springer
143views Education» more  CORR 2008»
14 years 10 months ago
A Type System for Data-Flow Integrity on Windows Vista
The Windows Vista operating system implements an interesting model of multi-level integrity. We observe that in this model, trusted code must participate in any information-flow a...
Avik Chaudhuri, Prasad Naldurg, Sriram K. Rajamani
IJNSEC
2008
190views more  IJNSEC 2008»
14 years 10 months ago
Probabilistic Analysis and Verification of the ASW Protocol using PRISM
The ASW protocol is one of the prominent optimistic fair exchange protocols that is used for contract signing between two participants, the originator and the responder, with the ...
Salekul Islam, Mohammad Abu Zaid
APLAS
2010
ACM
14 years 10 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
EMSOFT
2004
Springer
15 years 4 months ago
A model-based approach to integrating security policies for embedded devices
Embedded devices like smart cards can now run multiple interacting applications. A particular challenge in this domain is to dynamically integrate diverse security policies. In th...
Michael McDougall, Rajeev Alur, Carl A. Gunter