Skip to main content
Log in

Towards a Formal Treatment of Implicit Invocation Using Rely/Guarantee Reasoning

  • Original Paper
  • Published:
Formal Aspects of Computing

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received August 1997 / Accepted in revised form June 1998

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001650050011

Navigation