8 search results - page 1 / 2 » Detecting concurrently executed pairs of statements using an... |
SIGADA
2001
Springer
13 years 9 months ago
2001
Springer
TRIER
2002
13 years 4 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
CGO
2009
IEEE
13 years 8 months ago
2009
IEEE
Effectively migrating sequential applications to take advantage of parallelism available on multicore platforms is a well-recognized challenge. This paper addresses important aspec...
TACAS
2012
Springer
12 years 7 days ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
FASE
2006
Springer
13 years 8 months ago
2006
Springer
We present an algorithm for automatic testing of distributed programs, such as Unix processes with inter-process communication and Web services. Specifically, we assume that a prog...