Sciweavers

181 search results - page 18 / 37
» Programming Language Techniques for Cryptographic Proofs
Sort
View
ASPLOS
2000
ACM
15 years 2 months ago
OceanStore: An Architecture for Global-Scale Persistent Storage
OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since this infrastructure is comprised of untrusted serv...
John Kubiatowicz, David Bindel, Yan Chen, Steven E...
CCS
2011
ACM
13 years 9 months ago
Information-flow types for homomorphic encryptions
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
Cédric Fournet, Jérémy Planul...
CORR
2012
Springer
232views Education» more  CORR 2012»
13 years 5 months ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...
PLDI
2009
ACM
15 years 4 months ago
Proving optimizations correct using parameterized program equivalence
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validat...
Sudipta Kundu, Zachary Tatlock, Sorin Lerner
CORR
2000
Springer
133views Education» more  CORR 2000»
14 years 9 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu