Sciweavers

Share
POPL
2011
ACM
7 years 10 months ago
Precise reasoning for programs using containers
Containers are general-purpose data structures that provide functionality for inserting, reading, removing, and iterating over elements. Since many applications written in modern ...
Isil Dillig, Thomas Dillig, Alex Aiken
POPL
2011
ACM
7 years 10 months ago
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol
We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling pr...
Martin D. Schwarz, Helmut Seidl, Vesal Vojdani, Pe...
POPL
2011
ACM
7 years 10 months ago
Learning minimal abstractions
Percy Liang, Omer Tripp, Mayur Naik
POPL
2011
ACM
7 years 10 months ago
Mathematizing C++ concurrency
Shared-memory concurrency in C and C++ is pervasive in systems programming, but has long been poorly defined. This motivated an ongoing shared effort by the standards committees ...
Mark Batty, Scott Owens, Susmit Sarkar, Peter Sewe...
POPL
2011
ACM
7 years 10 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
POPL
2011
ACM
7 years 10 months ago
Calling context abstraction with shapes
Xavier Rival, Bor-Yuh Evan Chang
POPL
2011
ACM
7 years 10 months ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
POPL
2011
ACM
7 years 10 months ago
Generative type abstraction and type-level computation
Stephanie Weirich, Dimitrios Vytiniotis, Simon L. ...
POPL
2011
ACM
7 years 10 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
POPL
2011
ACM
7 years 10 months ago
The essence of compiling with traces
The technique of trace-based just-in-time compilation was introduced by Bala et al. and was further developed by Gal et al. It currently enjoys success in Mozilla Firefox’s Java...
Shu-yu Guo, Jens Palsberg
books