PLDI
2015
ACM
8 years 9 months ago
2015
ACM
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...
PLDI
2015
ACM
8 years 9 months ago
2015
ACM
The support for generic programming in modern object-oriented programming languages is awkward and lacks desirable expressive power. We introduce an expressive genericity mechanis...
PLDI
2015
ACM
8 years 9 months ago
2015
ACM
We consider the problem of automated reasoning about dynamically manipulated data structures. Essential properties are encoded as predicates whose definitions are formalized via ...
PLDI
2015
ACM
8 years 9 months ago
2015
ACM
PLDI
2015
ACM
8 years 9 months ago
2015
ACM
PLDI
2015
ACM
8 years 9 months ago
2015
ACM
We introduce SnapQueues - concurrent, lock-free queues with a linearizable, lock-free global-state transition operation. This transition operation can atomically switch between ar...
PLDI
2015
ACM
8 years 9 months ago
2015
ACM
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, ...
PLDI
2015
ACM
8 years 9 months ago
2015
ACM
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...
PLDI
2015
ACM
8 years 9 months ago
2015
ACM
This paper presents KJS, the most complete and throughly tested formal semantics of JavaScript to date. Being executable, KJS has been tested against the ECMAScript 5.1 conformanc...
PLDI
2015
ACM
8 years 9 months ago
2015
ACM
We present Symbiosis: a concurrency debugging technique based on novel differential schedule projections (DSPs). A DSP shows the small set of memory operations and data-flows res...