Sciweavers

1322 search results - page 100 / 265
» Unsound Theorem Proving
Sort
View
LPNMR
1997
Springer
14 years 2 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
ICFP
2004
ACM
14 years 10 months ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
TCC
2007
Springer
124views Cryptology» more  TCC 2007»
14 years 4 months ago
Tackling Adaptive Corruptions in Multicast Encryption Protocols
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
Saurabh Panjwani
TAPSOFT
1991
Springer
14 years 1 months ago
Comparative Semantics for a Real-Time Programming Language with Integration
An operational and a denotational semantic model are presented for a real-time programming language incorporating the concept of integration. This concept of integration, which ha...
Franck van Breugel
NJC
2006
86views more  NJC 2006»
13 years 10 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...