Sciweavers

PLDI
2015
ACM
8 years 8 months ago
Sound reasoning about integral data types with a reusable SMT solver interface
We extend the Leon verification system for Scala with support for bitvector reasoning, thus addressing one of its fundamental soundness limitation with respect to the treatment o...
Régis Blanc, Viktor Kuncak
PLDI
2015
ACM
8 years 8 months ago
Many-core compiler fuzzing
We address the compiler correctness problem for many-core systems through novel applications of fuzz testing to OpenCL compilers. Focusing on two methods from prior work, random d...
Christopher Lidbury, Andrei Lascu, Nathan Chong, A...
PLDI
2015
ACM
8 years 8 months ago
The Push/Pull model of transactions
We present a general theory of serializability, unifying a wide range of transactional algorithms, including some that are yet to come. To this end, we provide a compact semantics...
Eric Koskinen, Matthew J. Parkinson
PLDI
2015
ACM
8 years 8 months ago
Lightweight, flexible object-oriented generics
The support for generic programming in modern object-oriented programming languages is awkward and lacks desirable expressive power. We introduce an expressive genericity mechanis...
Yizhou Zhang, Matthew C. Loring, Guido Salvaneschi...
PLDI
2015
ACM
8 years 8 months ago
Automatic induction proofs of data-structures in imperative programs
We consider the problem of automated reasoning about dynamically manipulated data structures. Essential properties are encoded as predicates whose definitions are formalized via ...
Duc-Hiep Chu, Joxan Jaffar, Minh-Thai Trinh
PLDI
2015
ACM
8 years 8 months ago
Blame and coercion: together again for the first time
Jeremy G. Siek, Peter Thiemann, Philip Wadler
PLDI
2015
ACM
8 years 8 months ago
Abstract expressionism for parallel performance
Robert Bernecky, Sven-Bodo Scholz
PLDI
2015
ACM
8 years 8 months ago
SnapQueue: lock-free queue with constant time snapshots
We introduce SnapQueues - concurrent, lock-free queues with a linearizable, lock-free global-state transition operation. This transition operation can atomically switch between ar...
Aleksandar Prokopec
PLDI
2015
ACM
8 years 8 months ago
Design your analysis: a case study on implementation reusability of data-flow functions
The development of efficient data flow analyses is a complicated task. As requirements change and special cases have to be considered, implementations may get hard to maintain, ...
Johannes Lerch, Ben Hermann
PLDI
2015
ACM
8 years 8 months ago
DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs
A hierarchical program is one with multiple procedures but no loops or recursion. This paper studies the problem of deciding reachability queries in hierarchical programs where in...
Akash Lal, Shaz Qadeer