Reducing Context-Bounded Concurrent Reachability to Sequential Reachability

  title={Reducing Context-Bounded Concurrent Reachability to Sequential Reachability},
  author={Salvatore La Torre and P. Madhusudan and Gennaro Parlato},
We give a translation from concurrent programs to sequential programs that reduces the context-bounded reachability problem in the concurrent program to a reachability problem in the sequential one. The translation has two salient features: (a) the sequential program tracks, at any time, the local state of only one thread (though it does track multiple copies of shared variables), and (b) all reachable states of the sequential program correspond to reachable states of the concurrent program. We… CONTINUE READING
Highly Cited
This paper has 115 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 70 extracted citations

Efficient verification of periodic programs using sequential consistency and snapshots

2014 Formal Methods in Computer-Aided Design (FMCAD) • 2014
View 7 Excerpts
Highly Influenced

Automated Technology for Verification and Analysis

Lecture Notes in Computer Science • 2016
View 9 Excerpts
Highly Influenced

115 Citations

Citations per Year
Semantic Scholar estimates that this publication has 115 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Similar Papers

Loading similar papers…