POPL
2010
ACM
14 years 1 months ago
2010
ACM
POPL
2010
ACM
14 years 1 months ago
2010
ACM
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...
POPL
2010
ACM
14 years 1 months ago
2010
ACM
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...
POPL
2010
ACM
14 years 1 months ago
2010
ACM
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...
POPL
2010
ACM
14 years 1 months ago
2010
ACM
Traditional transactional memory systems suffer from overly conservative conflict detection, yielding so-called false conflicts, because they are based on fine-grained, low-level ...
POPL
2010
ACM
14 years 1 months ago
2010
ACM
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...