Sciweavers

204 search results - page 15 / 41
» A Connection Based Proof Method for Intuitionistic Logic
Sort
View
TASE
2007
IEEE
14 years 1 months ago
Design of a Certifying Compiler Supporting Proof of Program Safety
Safety is an important property of high-assurance software, and one of the hot research topics on it is the verification method for software to meet its safety policies. In our p...
Yiyun Chen, Lin Ge, Baojian Hua, Zhaopeng Li, Chen...
CSFW
2006
IEEE
14 years 1 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
LOGCOM
2006
101views more  LOGCOM 2006»
13 years 7 months ago
Tableau-based Decision Procedures for Hybrid Logic
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision p...
Thomas Bolander, Torben Braüner
POPL
2012
ACM
12 years 3 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
ENTCS
2007
113views more  ENTCS 2007»
13 years 7 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi