Model Checking Implicit-Invocation Systems

  • Authors:
  • David Garlan;Serge Khersonsky

  • Affiliations:
  • Carnegie Mellon University, School of Computer Science, 5000 Forbes Avenue, Pittsburgh, PA;Carnegie Mellon University, School of Computer Science, 5000 Forbes Avenue, Pittsburgh, PA

  • Venue:
  • IWSSD '00 Proceedings of the 10th International Workshop on Software Specification and Design
  • Year:
  • 2000

Quantified Score

Hi-index 0.02

Visualization

Abstract

While implicit invocation (publish-subscribe) systems have good engineering properties, they are difficult to reason about and to test. Model checking such systems is an attractive alternative. However, it is not clear what kinds of state models are best suited for this. In this paper, we propose a structural approach, which factors the model-checking problem into two parts: behavior specific to a particular implicit invocation system, and reusable run-time infrastructure that handles event-based communication and delivery policies. The reusable portion is itself structured so that alternative run-time mechanisms may be experimented with.