Sciweavers

8132 search results - page 44 / 1627
» Dependability, Abstraction, and Programming
Sort
View
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
15 years 4 months ago
Evaluating Branching Programs on Encrypted Data
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
Yuval Ishai, Anat Paskin
ENTCS
2008
110views more  ENTCS 2008»
14 years 10 months ago
On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract)
ly abstract model for a quantum unctional language (extended abstract) Peter Selinger1 ,2 Dalhousie University, Halifax, Nova Scotia, Canada Beno^it Valiron3 University of Ottawa, ...
Peter Selinger, Benoît Valiron
APLAS
2010
ACM
14 years 10 months ago
Data Structure Fusion
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
ECOOP
2012
Springer
13 years 9 days ago
Application-Only Call Graph Construction
Abstract. Since call graphs are an essential starting point for all interprocedural analyses, many tools and frameworks have been developed to generate the call graph of a given pr...
Karim Ali, Ondrej Lhoták
POPL
2010
ACM
15 years 7 months ago
Automatic Numeric Abstractions for Heap-Manipulating Programs
Stephen Magill, Ming-Hsien Tsai, Peter Lee, Yih-Ku...