Sciweavers

169 search results - page 23 / 34
» Which Languages Have 4-Round Zero-Knowledge Proofs
Sort
View
AGTIVE
2003
Springer
14 years 24 days ago
Specifying Pointer Structures by Graph Reduction
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
Adam Bakewell, Detlef Plump, Colin Runciman
PLDI
2006
ACM
14 years 1 months ago
Correctness-preserving derivation of concurrent garbage collection algorithms
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
Martin T. Vechev, Eran Yahav, David F. Bacon
POPL
2007
ACM
14 years 7 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
ESOP
2006
Springer
13 years 11 months ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker
POPL
2006
ACM
14 years 7 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...