Skip to main content
Conference ProceedingsOPEN ACCESS

Interprocedural analysis of concurrent programs under a context bound

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4963 LNCS 282-298
DOI: 10.1007/978-3-540-78800-3_20
55Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Analysis of recursive programs in the presence of concurrency and shared memory is undecidable. In previous work, Qadeer and Rehof [23] showed that context-bounded analysis is decidable for recursive programs under a finite-state abstraction of program data. In this paper, we show that context-bounded analysis is decidable for certain families of infinite-state abstractions, and also provide a new symbolic algorithm for the finite-state case. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lal, A., Touili, T., Kidd, N., & Reps, T. (2008). Interprocedural analysis of concurrent programs under a context bound. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4963 LNCS, pp. 282–298). https://doi.org/10.1007/978-3-540-78800-3_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free