Sciweavers

442 search results - page 14 / 89
» Proof Abstraction for Imperative Languages
Sort
View
PLPV
2011
ACM
12 years 11 months ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
TCC
2004
Springer
835views Cryptology» more  TCC 2004»
14 years 1 months ago
On the Possibility of One-Message Weak Zero-Knowledge
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
Boaz Barak, Rafael Pass
APLAS
2011
ACM
12 years 8 months ago
Decentralized Delimited Release
Abstract. Decentralization is a major challenge for secure computing. In a decentralized setting, principals are free to distrust each other. The key challenge is to provide suppor...
Jonas Magazinius, Aslan Askarov, Andrei Sabelfeld
ASM
2003
ASM
14 years 1 months ago
ASMs versus Natural Semantics: A Comparison with New Insights
Abstract. We compare three specification frameworks for the operationtics of programming languages, abstract state machines (ASMs) and the two incarnations of natural semantics, b...
Sabine Glesner
POPL
2010
ACM
14 years 6 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala