Article

Reducing Context-Bounded Concurrent Reachability to Sequential Reachability

Authors:

Salvatore Torre,

P. Madhusudan,

Gennaro ParlatoAuthors Info & Claims

CAV '09: Proceedings of the 21st International Conference on Computer Aided Verification

Pages 477 - 492

https://doi.org/10.1007/978-3-642-02658-4_36

Published: 23 June 2009 Publication History

Abstract

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 also implement our transformation in the setting of concurrent recursive programs with finite data domains, and show that the resulting sequential program can be model-checked efficiently using existing recursive sequential program reachability tools.

References

[1]

Bouajjani, A., Fratani, S., Qadeer, S.: Context-bounded analysis of multithreaded programs with dynamic linked structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 207-220. Springer, Heidelberg (2007).

Crossref

Google Scholar

[2]

Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 324-336. Springer, Heidelberg (2001).

Crossref

Google Scholar

[3]

La Torre, S., Madhusudan, P., Parlato, G.: Context-bounded analysis of concurrent queue systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299-314. Springer, Heidelberg (2008).

Crossref

Google Scholar

[4]

La Torre, S., Madhusudan, P., Parlato, G.: Analyzing recursive programs using a fixed-point calculus. In: PLDI (2009).

Crossref

Google Scholar

[5]

Lahiri, S.K., Qadeer, S., Rakamaric, Z.: Static and Precise Detection of Concurrency Errors in Systems Code using SMT solvers. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 509-524. Springer, Heidelberg (2009).

Crossref

Google Scholar

[6]

Lal, A., Reps, T.W.: Reducing concurrent analysis under a context bound to sequential analysis. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 37-51. Springer, Heidelberg (2008).

Crossref

Google Scholar

[7]

Lal, A., Touili, T., Kidd, N., Reps, T.W.: Interprocedural analysis of concurrent programs under a context bound. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 282-298. Springer, Heidelberg (2008).

Crossref

Google Scholar

[8]

Musuvathi, M., Qadeer, S.: Chess: Systematic stress testing of concurrent software. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 15-16. Springer, Heidelberg (2007).

Crossref

Google Scholar

[9]

Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: PLDI, pp. 446-455. ACM, New York (2007).

Crossref

Google Scholar

[10]

Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93-107. Springer, Heidelberg (2005).

Crossref

Google Scholar

[11]

Qadeer, S., Wu, D.: Kiss: keep it simple and sequential. In: PLDI, pp. 14-24. ACM, New York (2004).

Crossref

Google Scholar

[12]

Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22(2), 416-430 (2000).

Crossref

Google Scholar

[13]

Suwimonteerabuth, D., Esparza, J., Schwoon, S.: Symbolic context-bounded analysis of multithreaded java programs. In: Havelund, K., Majumdar, R., Palsberg, J. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 270-287. Springer, Heidelberg (2008).

Crossref

Google Scholar

Cited By

View all

Faella MGarbi GLa Torre SParlato G(2024)CHC-Based Verification of Programs Through Graph DecompositionsSN Computer Science10.1007/s42979-024-03371-65:8Online publication date: 18-Nov-2024
https://dl.acm.org/doi/10.1007/s42979-024-03371-6
Fischer BGarbi GLa Torre SParlato GSchrammel P(2024)Static Data Race Detection via Lazy SequentializationNetworked Systems10.1007/978-3-031-67321-4_8(124-141)Online publication date: 29-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-67321-4_8
Abdulla PAtig MFurbach FGarg S(2024)Verification under TSO with an infinite Data DomainTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57256-2_14(276-295)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57256-2_14
Show More Cited By

Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
2. Theory of computation

Recommendations

Simultaneous reachability analysis of concurrent systems
Reachability and reverse reachability analysis of CFSMs

Reachability analysis and the recently proposed reverse reachability analysis are two important verification techniques for communicating finite state machines (CFSM). The issue of the relative efficiency of reachability analysis and reverse ...
Deadlock Detection of EFSMs Using Simultaneous Reachability Analysis
DSN '00: Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)

Simultaneous reachability analysis (SRA) is a recently proposed technique to alleviate the state space explosion problem in reachability analysis of concurrent systems. Its goal is to reduce the number of generated states while guaranteeing the ...

Comments

Information & Contributors

Information

Published In

CAV '09: Proceedings of the 21st International Conference on Computer Aided Verification

June 2009

720 pages

ISBN:9783642026577

Editors:
Ahmed Bouajjani
LIAFA, University Paris Diderot (Paris 7), Case 7014, Paris Cedex 13, France 75205
,
Oded Maler
Verimag, Centre Equation, Gières, France 38610

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 23 June 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

53
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Faella MGarbi GLa Torre SParlato G(2024)CHC-Based Verification of Programs Through Graph DecompositionsSN Computer Science10.1007/s42979-024-03371-65:8Online publication date: 18-Nov-2024
https://dl.acm.org/doi/10.1007/s42979-024-03371-6
Fischer BGarbi GLa Torre SParlato GSchrammel P(2024)Static Data Race Detection via Lazy SequentializationNetworked Systems10.1007/978-3-031-67321-4_8(124-141)Online publication date: 29-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-67321-4_8
Abdulla PAtig MFurbach FGarg S(2024)Verification under TSO with an infinite Data DomainTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-031-57256-2_14(276-295)Online publication date: 6-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57256-2_14
Pick LDesai AGupta A(2023)Psym: Efficient Symbolic Exploration of Distributed SystemsProceedings of the ACM on Programming Languages10.1145/35912477:PLDI(660-685)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591247
Baumann PGanardi MMajumdar RThinniyam RZetzsche G(2023)Context-Bounded Verification of Context-Free SpecificationsProceedings of the ACM on Programming Languages10.1145/35712667:POPL(2141-2170)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571266
Di Giusto CFerré DLaversa LLozes E(2023)A Partial Order View of Message-Passing Communication ModelsProceedings of the ACM on Programming Languages10.1145/35712487:POPL(1601-1627)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571248
Inverso OLa Torre SParlato GTomasco E(2023)Verifying Programs by Bounded Tree-Width Behavior GraphsMulti-Agent Systems10.1007/978-3-031-43264-4_8(116-132)Online publication date: 14-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43264-4_8
Farzan AKlumpp DPodelski AJhala RDillig I(2022)Sound sequentialization for concurrent program verificationProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523727(506-521)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523727
Baumann PMajumdar RThinniyam RZetzsche G(2022)Context-bounded verification of thread poolsProceedings of the ACM on Programming Languages10.1145/34986786:POPL(1-28)Online publication date: 12-Jan-2022
https://dl.acm.org/doi/10.1145/3498678
Inverso OTomasco EFischer BLa Torre SParlato G(2021)Bounded Verification of Multi-threaded Programs via Lazy SequentializationACM Transactions on Programming Languages and Systems10.1145/347853644:1(1-50)Online publication date: 9-Dec-2021
https://dl.acm.org/doi/10.1145/3478536
Show More Cited By

Abstract

References

Cited By

Recommendations

Simultaneous reachability analysis of concurrent systems

Reachability and reverse reachability analysis of CFSMs

Deadlock Detection of EFSMs Using Simultaneous Reachability Analysis

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations