Sciweavers

24 search results - page 2 / 5
» Proofs About Lists Using Ellipsis
Sort
View
POPL
2008
ACM
15 years 9 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
POPL
2008
ACM
15 years 9 months ago
Formal verification of translation validators: a case study on instruction scheduling optimizations
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
Jean-Baptiste Tristan, Xavier Leroy
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
15 years 10 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
163
Voted
POPL
2006
ACM
15 years 9 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
ACISP
2007
Springer
15 years 3 months ago
A Practical System for Globally Revoking the Unlinkable Pseudonyms of Unknown Users
We propose the first single sign-on system in which a user can access services using unlinkable digital pseudonyms that can all be revoked in case she abuses any one service. Our ...
Stefan Brands, Liesje Demuynck, Bart De Decker