| Reasoning about implicit invocation |
| Full text |
Pdf
(1.24 MB)
|
| Source
|
Foundations of Software Engineering
archive
Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
table of contents
Lake Buena Vista, Florida, United States
Pages: 209 - 221
Year of Publication: 1998
ISBN:1-58113-108-9
Also published in ...
|
|
Authors
|
|
D. Garlan
|
School of Computer Science Carnegie Mellon University Pittsburgh, PA
|
|
S. Jha
|
School of Computer Science Carnegie Mellon University, Pittsburgh, PA
|
|
D. Notkin
|
Dept. of Computer Science and Engineering, University of Washington, Seattle, WA
|
|
J. Dingel
|
School of Computer Science Carnegie Mellon University, Pittsburgh, PA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 24, Citation Count: 4
|
|
|
ABSTRACT
Implicit invocation [SN92, GN91] has become an important architectural style for large-scale system design and evolution. This paper addresses the lack of specification and verification formalisms for such systems. Based on standard notions from process algebra and trace semantics, we define a formal computational model for implicit invocation. A verification methodology is presented that supports linear time temporal logic and compositional reasoning. First, the entire system is partioned into groups of components (methods) that behave independently. Then, local properties are proved for each of the groups. A precise description of the cause and the effect of an event supports this step. Using local correctness, independence of groups, and properties of the delivery of events, we infer the desired property of the overall system. Two detailed examples illustrate the use of our framework.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
AAG95
|
|
 |
BCTW96
|
|
| |
BG99
|
A. Berry and D. Garlan. Making architectural analysis reasonable. In Proceedings of First Ii'o&ing IFIP Conference on Software Architeture (WICSAl), February 1999. To appear.
|
 |
BJ89
|
|
 |
BN84
|
|
| |
CM88
|
|
| |
Cor91
|
The Common Object Request Broker: Architecture and specification. OMG Document Number 91.12.1, December 1991. Revision 1.1 (Draft 10).
|
| |
DGJN98
|
J. Dingel, D. Garlan, S. Jha, and D. Notkin. Towards a formal treatment of implicit invocation using rely/guarantee reasoning. Formal Aspects of Computing, 199s. To appear.
|
| |
Dij76
|
|
| |
Din97
|
|
| |
dR85
|
W.P. de Roever. The quest for compositionality - a survey of assertion-based proof systems for concurrent programs. Part I: Concurrency based on shared variables. In E. J. Neuhold and G. C&oust, editors, Formal Methods in Programming. IFIP, Elsevier Science Publishers, 1955.
|
| |
Ger89
|
C. Gerety. HP Softbench: A new generation of software development tools. Technical Report SESD-89-25, Hewlett-Packard Software Engineering Systems Division, Fort Collins, Colorado, November 1989.
|
| |
GHJV95
|
|
| |
GKN92
|
|
| |
GN91
|
|
| |
Gol84
|
|
| |
GZ97
|
|
 |
Hoa69
|
|
| |
Hoa85
|
|
| |
ISO87
|
ISO. Information processing systems - open systems interconnection - LOTOS - a formal description technique based on the temporal ordering of observational behaviour. Technical Report ISO/TC 97/SC 21, International Standards Organization, 1987.
|
 |
Jon83
|
|
| |
Jub98
|
|
| |
KP88
|
|
| |
Mil80
|
R. Mimer. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer Verlag, 1980.
|
 |
OG76
|
|
| |
Rei90
|
|
| |
San90
|
B.A. Sanders. Stepwise refinement of mixed specifications of concurrent programs. In M. Broy and C.B. Jones, editors, Proceedings of IFIP Working Conference on Programming and Methods, pages l-25. EIsevier Science Publishers (North Holland), May 1990.
|
 |
SN92
|
|
| |
Sun93
|
SunSoft. Tooltalk 1.1.1 Users's Guide, November 1993.
|
|