DMCA
Z.: Verification of parameterized concurrent programs by modular reasoning about data and control (2012)
| Venue: | In: POPL’12 |
| Citations: | 8 - 4 self |
BibTeX
@INPROCEEDINGS{Farzan12z.:verification,
author = {Azadeh Farzan and Zachary Kincaid},
title = {Z.: Verification of parameterized concurrent programs by modular reasoning about data and control},
booktitle = {In: POPL’12},
year = {2012},
pages = {297--308},
publisher = {ACM}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we consider the problem of verifying thread-state properties of multithreaded programs in which the number of ac-tive threads cannot be statically bounded. Our approach is based on decomposing the task into two modules, where one reasons about data and the other reasons about control. The data module computes thread-state invariants (e.g., linear constraints over global variables and local variables of one thread) using the thread interference in-formation computed by the control module. The control module computes a representation of thread interference, as an incremen-tally constructed data flow graph, using the data invariants provided by the data module. These invariants are used to rule out patterns of thread interference that can not occur in a real program execu-tion. The two modules are incorporated into a feedback loop, so that the abstractions of data and interference are iteratively coars-
Keyphrases
parameterized concurrent program control module data module thread interference ac-tive thread data invariant linear constraint thread-state property thread interference in-formation real program execu-tion data flow graph feedback loop global variable multithreaded program local variable thread-state invariant
