Abstract.
Implicit invocation [SuN92, GaN91] 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. 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received August 1997 / Accepted in revised form June 1998
Rights and permissions
About this article
Cite this article
Dingel, J., Garlan, D., Jha, S. et al. Towards a Formal Treatment of Implicit Invocation Using Rely/Guarantee Reasoning. Form Aspects Comput 10, 193–213 (1998). https://doi.org/10.1007/s001650050011
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001650050011