Article

Compositionality entails sequentializability

Authors:

P. MadhusudanAuthors Info & Claims

TACAS'11/ETAPS'11: Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software

Pages 26 - 40

Published: 26 March 2011 Publication History

Abstract

We show that any concurrent program that is amenable to compositional reasoning can be effectively translated to a sequential program. More precisely, we give a reduction from the verification problem for concurrent programs against safety specifications to the verification of sequential programs against safety specifications, where the reduction is parameterized by a set of auxiliary variables A, such that the concurrent program compositionally satisfies its specification using auxiliary variables A iff the sequentialization satisfies its specification. Existing sequentializations for concurrent programs work only for underapproximations like bounded context-switching, while our sequentialization has the salient feature that it can prove concurrent programs entirely correct, as long as it has a compositional proof. The sequentialization allows us to use sequential verification tools (including deductive verification tools and predicate abstraction tools) to analyze and prove concurrent programs correct. We also report on our experience in the deductive verification of concurrent programs by proving their sequential counterparts using the program verifier BOOGIE.

References

[1]

Alur, R., Madhusudan, P., Nam, W.: Symbolic compositional verification by learning assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 548-562. Springer, Heidelberg (2005)

Digital Library

[2]

Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. In: POPL, pp. 1-3. ACM, New York (2002)

Digital Library

[3]

Cobleigh, J.M., Giannakopoulou, D., Păsăreanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331-346. Springer, Heidelberg (2003)

Digital Library

[4]

Cohen, A., Namjoshi, K.S.: Local proofs for global safety properties. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 55-67. Springer, Heidelberg (2007)

Digital Library

[5]

Feng, X.: Local rely-guarantee reasoning. In: POPL, pp. 315-327. ACM, New York (2009)

Digital Library

[6]

Flanagan, C., Freund, S.N., Qadeer, S.: Thread-modular verification for sharedmemory programs. In: Le Métayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, pp. 262-277. Springer, Heidelberg (2002)

Digital Library

[7]

Flanagan, C., Qadeer, S.: Thread-modular model checking. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 213-224. Springer, Heidelberg (2003)

Digital Library

[8]

Ghafari, N., Hu, A.J., Rakamarić, Z.: Context-bounded translations for concurrent software: An empirical evaluation. In: van de Pol, J., Weber, M. (eds.) SPIN 2010. LNCS, vol. 6349, pp. 227-244. Springer, Heidelberg (2010)

Digital Library

[9]

Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. 5(4), 596-619 (1983)

Digital Library

[10]

La Torre, S., Madhusudan, P., Parlato, G.: Reducing context-bounded concurrent reachability to sequential reachability. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 477-492. Springer, Heidelberg (2009)

Digital Library

[11]

La Torre, S., Madhusudan, P., Parlato, G.: Sequentializing parameterized programs (2010), http://www.cs.uiuc.edu/~madhu/seqparam.pdf

[12]

Lahiri, S.K., Qadeer, S., Rakamarić, 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)

Digital Library

[13]

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)

Digital Library

[14]

Lubachevsky, B.D.: An approach to automating the verification of compact parallel coordination programs. Acta Inf. 21, 125-169 (1984)

Digital Library

[15]

Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs. Acta Inf. 6, 319-340 (1976)

Digital Library

[16]

Xu, Q., de Roever, W.P., He, J.: The rely-guarantee method for verifying shared variable concurrent programs. Formal Asp. Comput. 9(2), 149-174 (1997)

Digital Library

Cited By

Emmi MOzkan BTasiran SRungta NTkachuk O(2014)Exploiting synchronization in the analysis of shared-memory asynchronous programsProceedings of the 2014 International SPIN Symposium on Model Checking of Software10.1145/2632362.2632370(20-29)Online publication date: 21-Jul-2014
https://dl.acm.org/doi/10.1145/2632362.2632370
Atig MBouajjani AEmmi MLal A(2012)Detecting fair non-termination in multithreaded programsProceedings of the 24th international conference on Computer Aided Verification10.1007/978-3-642-31424-7_19(210-226)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31424-7_19
Bouajjani AEmmi MParlato G(2011)On sequentializing concurrent programsProceedings of the 18th international conference on Static analysis10.5555/2041552.2041565(129-145)Online publication date: 14-Sep-2011
https://dl.acm.org/doi/10.5555/2041552.2041565

Recommendations

Modeling and Verification of Reactive Systems using Rebeca

Actor-based modeling has been successfully applied to the representation of concurrent and distributed systems. Besides having an appropriate and efficient way for modeling these systems, one needs a formal verification approach for ensuring their ...
Modeling and Verification of Reactive Systems using Rebeca

Actor-based modeling has been successfully applied to the representation of concurrent and distributed systems. Besides having an appropriate and efficient way for modeling these systems, one needs a formal verification approach for ensuring their ...
Automated interface refinement for compositional verification

Compositional verification is essential for verifying large systems. However, approximate environments are needed when verifying the constituent modules in a system. Effective compositional verification requires finding a simple but accurate ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

TACAS'11/ETAPS'11: Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software

March 2011

392 pages

ISBN:9783642198342

Editors:
Parosh Aziz Abdulla
University of Uppsala, Dept. of Information Technology, Uppsala, Sweden
,
K. Rustan M. Leino
Microsoft Research, Redmond,WA

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 March 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Emmi MOzkan BTasiran SRungta NTkachuk O(2014)Exploiting synchronization in the analysis of shared-memory asynchronous programsProceedings of the 2014 International SPIN Symposium on Model Checking of Software10.1145/2632362.2632370(20-29)Online publication date: 21-Jul-2014
https://dl.acm.org/doi/10.1145/2632362.2632370
Atig MBouajjani AEmmi MLal A(2012)Detecting fair non-termination in multithreaded programsProceedings of the 24th international conference on Computer Aided Verification10.1007/978-3-642-31424-7_19(210-226)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31424-7_19
Bouajjani AEmmi MParlato G(2011)On sequentializing concurrent programsProceedings of the 18th international conference on Static analysis10.5555/2041552.2041565(129-145)Online publication date: 14-Sep-2011
https://dl.acm.org/doi/10.5555/2041552.2041565

View Options

View options

Media

Figures

Other

Tables

View Table of Contents