Sciweavers

1322 search results - page 210 / 265
» Unsound Theorem Proving
Sort
View
NDJFL
1998
100views more  NDJFL 1998»
13 years 8 months ago
Failure of Interpolation in Combined Modal Logics
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...
Maarten Marx, Carlos Areces
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 7 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
SAC
2010
ACM
13 years 6 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 6 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
FSE
2011
Springer
289views Cryptology» more  FSE 2011»
13 years 8 days ago
On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model
Abstract. Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictabilit...
Martin R. Albrecht, Pooya Farshim, Kenny G. Paters...