Sciweavers

432 search results - page 8 / 87
» The Interleaving Problem in Program Understanding
Sort
View
PLDI
2004
ACM
15 years 5 months ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
PPOPP
2009
ACM
16 years 5 days ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
AGP
2003
IEEE
15 years 5 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
CAV
2012
Springer
236views Hardware» more  CAV 2012»
13 years 2 months ago
Lock Removal for Concurrent Trace Programs
Abstract. We propose a trace-based concurrent program analysis to soundly remove redundant synchronizations such as locks while preserving the behaviors of the concurrent computati...
Vineet Kahlon, Chao Wang
SPIN
2005
Springer
15 years 5 months ago
Symbolic Model Checking for Asynchronous Boolean Programs
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...
Byron Cook, Daniel Kroening, Natasha Sharygina