Sciweavers

1411 search results - page 89 / 283
» Interactive Coding for Interactive Proofs
Sort
View
FMOODS
2007
15 years 2 months ago
A Mechanized Model of the Theory of Objects
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
Ludovic Henrio, Florian Kammüller
94
Voted
DCC
2005
IEEE
16 years 4 days ago
Signcryption with Non-interactive Non-repudiation
Signcryption [35] is a public key primitive that achieves the functionality of both an encryption scheme and a signature scheme simultaneously. It does this more efficiently than a...
John Malone-Lee
95
Voted
TASE
2009
IEEE
15 years 7 months ago
The Logical Approach to Low-Level Stack Reasoning
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
Xinyu Jiang, Yu Guo, Yiyun Chen
94
Voted
RTA
2004
Springer
15 years 5 months ago
A Visual Environment for Developing Context-Sensitive Term Rewriting Systems
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...
Jacob Matthews, Robert Bruce Findler, Matthew Flat...
TCC
2004
Springer
100views Cryptology» more  TCC 2004»
15 years 5 months ago
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
Ran Canetti, Oded Goldreich, Shai Halevi