Name
Abstract | ||
|---|---|---|
We study in this paper the problem of analyzing implementations of open systems --- systems in which only some of the components are present. We present an algorithm for automatically closing an open concurrent reactive system with its most general environment, i.e., the environment that can provide any input at any time to the system. The result is a nondeterministic closed (i.e., self-executable) system which can exhibit all the possible reactive behaviors of the original open system. These behaviors can then be analyzed using VeriSoft, an existing tool for systematically exploring the state spaces of closed systems composed of multiple (possibly nondeterministic) processes executing arbitrary code. We have implemented the techniques introduced in this paper in a prototype tool for automatically closing open programs written in the C programming language. We discuss preliminary experimental results obtained with a large telephone-switching software application developed at Lucent Technologies. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1145/277652.277754 | PLDI |
Keywords | Field | DocType |
closed system,application development,reactive system,inlining,open system,threaded code,state space,just in time compilation | Threaded code,Programming language,Nondeterministic algorithm,Computer science,Implementation,Real-time computing,Software,Just-in-time compilation,C programming language,Open system (systems theory),Reactive system | Conference |
Volume | Issue | ISSN |
33 | 5 | 0362-1340 |
ISBN | Citations | PageRank |
0-89791-987-4 | 35 | 2.32 |
References | Authors | |
22 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christopher Colby | 1 | 237 | 18.39 |
| Patrice Godefroid | 2 | 3622 | 275.78 |
| Lalita Jategaonkar Jagadeesan | 3 | 286 | 29.80 |
| JagadeesanLalita Jategaonkar | 4 | 35 | 2.32 |