Sciweavers

Share
POPL
2010
ACM
9 years 7 months ago
Program Analysis via Satisfiability Modulo Path Programs
William R. Harris, Sriram Sankaranarayanan, Franjo...
POPL
2010
ACM
9 years 7 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
POPL
2010
ACM
9 years 7 months ago
Compositional May-Must Program Analysis: Unleashing the Power of Alternation
Program analysis tools typically compute two types of information: (1) may information that is true of all program executions and is used to prove the absence of bugs in the progr...
Aditya V. Nori, Patrice Godefroid, SaiDeep Tetali,...
POPL
2010
ACM
9 years 7 months ago
Sequential Verification of Serializability
Serializability is a commonly used correctness condition in concurrent programming. When a concurrent module is serializable, certain other properties of the module can be verifie...
G. Ramalingam, Hagit Attiya, Noam Rinetzky
POPL
2010
ACM
9 years 7 months ago
Coarse-Grained Transactions
Traditional transactional memory systems suffer from overly conservative conflict detection, yielding so-called false conflicts, because they are based on fine-grained, low-level ...
Eric Koskinen, Matthew Parkinson, Maurice Herlihy
POPL
2010
ACM
9 years 7 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
books