Advertisement

Formal Aspects of Computing

, Volume 10, Issue 3, pp 193–213 | Cite as

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

  • J. Dingel
  • D. Garlan
  • S. Jha
  • D. Notkin
Original Paper

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.

Keywords: Implicit invocation; Rely/guarantee; Assumption/commitment 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BCS 1998

Authors and Affiliations

  • J. Dingel
    • 1
  • D. Garlan
    • 1
  • S. Jha
    • 1
  • D. Notkin
    • 2
  1. 1.School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USAUS
  2. 2.Department of Computer Science, University of Washington, Seattle, WA, USAUS

Personalised recommendations