Towards a formal treatment of implicit invocation using rely/guarantee reasoning (1998) [17 citations — 5 self]
Download:
|
|
by J. Dingel, D. Garlan, S. Jha, D. Notkin
Formal Aspects of Computing
http://reports-archive.adm.cs.cmu.edu/anon/1997/CMU-CS-97-153.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Dingel98towardsa,author = {J. Dingel and D. Garlan and S. Jha and D. Notkin},
title = {Towards a formal treatment of implicit invocation using rely/guarantee reasoning},
journal = {Formal Aspects of Computing},
year = {1998},
volume = {10}
}
Years of Citing Articles
Abstract:
Implicit invocation [SN92,GN91] has become an important architectural style for largescale system design and evolution. This paper addresses the lack of specification and verification formalisms for such systems. A formal computational model for implicit invocation is presented. We develop a verification framework for implicit invocation that is based on Jones ' rely/guarantee reasoning for concurrent systems [Jon83,St��91]. The application of the framework is illustrated with several examples. The merits and limitations of the rely/guarantee paradigm in the context of implicit invocation systems are also discussed.
