169 search results - page 12 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
VSTTE
2005
Springer
14 years 1 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
VSTTE
2010
Springer
13 years 5 months ago
2010
Springer
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
EMO
2003
Springer
14 years 23 days ago
2003
Springer
This paper introduces an interface specification (PISA) that allows to separate the problem-specific part of an optimizer from the problem-independent part. We propose a view of ...
ESOP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...