Skip to main content
Conference Proceedings

Conflict analysis of programs with procedures, dynamic thread creation, and monitors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5079 LNCS 205-220
DOI: 10.1007/978-3-540-69166-2_14
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study conflict detection for programs with procedures, dynamic thread creation and a fixed finite set of (reentrant) monitors. We show that deciding the existence of a conflict is NP-complete for our model (that abstracts guarded branching by nondeterministic choice) and present a fixpoint-based complete conflict detection algorithm. Our algorithm needs worst-case exponential time in the number of monitors, but is linear in the program size. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Lammich, P., & Müller-Olm, M. (2008). Conflict analysis of programs with procedures, dynamic thread creation, and monitors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5079 LNCS, pp. 205–220). https://doi.org/10.1007/978-3-540-69166-2_14

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