Sciweavers

357 search results - page 41 / 72
» Specifying and Verifying Fault-Tolerant Systems
Sort
View
ESOP
2010
Springer
14 years 5 months ago
Precise and Automated Contract-based Reasoning for Verification and Certification of Information Flow Properties of Programs wit
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...
Torben Amtoft, John Hatcliff and Edwin Rodríguez
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
14 years 1 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
POLICY
2001
Springer
14 years 4 days ago
IPSec/VPN Security Policy: Correctness, Conflict Detection, and Resolution
IPSec (Internet Security Protocol Suite) functions will be executed correctly only if its policies are correctly specified and configured. Manual IPSec policy configuration is inef...
Zhi Fu, Shyhtsun Felix Wu, He Huang, Kung Loh, Fen...
ATAL
2005
Springer
14 years 1 months ago
A computationally grounded logic of knowledge, belief and certainty
This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded m...
Kaile Su, Abdul Sattar, Guido Governatori, Qinglia...
PPDP
2009
Springer
14 years 2 months ago
Dependent type inference with interpolants
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
Hiroshi Unno, Naoki Kobayashi