169 search results - page 8 / 34 » Which Languages Have 4-Round Zero-Knowledge Proofs |
ICFP
2012
ACM
11 years 10 months ago
2012
ACM
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
VSTTE
2005
Springer
14 years 1 months ago
2005
Springer
: Verifying design instead of code can be an effective and practical approach to obtaining verified software. This paper argues that proof scores are an attractive method for ver...
ASPDAC
2008
ACM
13 years 8 months ago
2008
ACM
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...