Sciweavers

827 search results - page 114 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
SIGMOD
2004
ACM
131views Database» more  SIGMOD 2004»
16 years 26 days ago
Order-Preserving Encryption for Numeric Data
Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an or...
Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikan...
120
Voted
ICFP
2002
ACM
16 years 21 days ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann
POPL
2010
ACM
15 years 10 months ago
A simple, verified validator for software pipelining
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...
Jean-Baptiste Tristan, Xavier Leroy
117
Voted
ESOP
2010
Springer
15 years 10 months ago
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
Keiko Nakata and Tarmo Uustalu
97
Voted
VMCAI
2010
Springer
15 years 10 months ago
Temporal Reasoning for Procedural Programs
While temporal verification of programs is a topic with a long history, its traditional basis--semantics based on word languages--is illsuited for modular reasoning about procedura...
Rajeev Alur, Swarat Chaudhuri