Sciweavers

Share
CC
2015
Springer
4 years 2 months ago
Verifying Fast and Sparse SSA-Based Optimizations in Coq
The Static Single Assignment (SSA) form is a predominant technology in modern compilers, enabling powerful and fast program optimizations. Despite its great success in the implemen...
Delphine Demange, David Pichardie, Léo Stef...
CC
2015
Springer
4 years 2 months ago
Protocols by Default - Safe MPI Code Generation Based on Session Types
This paper presents a code generation framework for type-safe and deadlock-free Message Passing Interface (MPI) programs. The code generation process starts with the definition of...
Nicholas Ng, José Gabriel de Figueiredo Cou...
CASES
2015
ACM
4 years 2 months ago
Timing characterization of OpenMP4 tasking model
OpenMP is increasingly being supported by the newest high-end embedded many-core processors. Despite the lack of any notion of real-time execution, the latest specification of Op...
CASES
2015
ACM
4 years 2 months ago
PAC: Program Analysis for Approximation-aware Compilation
Approximate computing is a paradigm for trading off program accuracy to save energy in memory or computational resources. However, determining feasible program approximations is ...
CASES
2015
ACM
4 years 2 months ago
Scheduling instruction effects for a statically pipelined processor
Statically pipelined processors have a fully exposed datapath where all portions of the pipeline are directly controlled by effects within an instruction, which simplifies hardw...
CC
2016
Springer
4 years 3 months ago
The complexity of estimating min-entropy
Goldreich, Sahai, and Vadhan (CRYPTO 1999) proved that the promise problem for estimating the Shannon entropy of a distribution sampled by a given circuit is NISZK-complete. We co...
Thomas Watson
CC
2016
Springer
4 years 3 months ago
Combinatorial PCPs with Short Proofs
The PCP theorem (Arora et. al., J. ACM 45(1,3)) asserts the existence of proofs that can be verified by reading a very small part of the proof. Since the discovery of the theorem...
Or Meir
CC
2016
Springer
4 years 3 months ago
Quantum commitments from complexity assumptions
Abstract. We study worst-case complexity assumptions that imply quantum bitcommitment schemes. First we show that QSZK ⊆ QMA implies a computationally hiding and statistically bi...
André Chailloux, Iordanis Kerenidis, Bill R...
CC
2016
Springer
4 years 3 months ago
Safe and flexible adaptation via alternate data structure representations
The choice of data structures is crucial for achieving high performance. For applications that are long-running and/or operate on large data sets, the best choice for main data st...
Amlan Kusum, Iulian Neamtiu, Rajiv Gupta
books