Using automatable proof obligations for component-based design checking

  • Authors:

  • Murali Rangarajan;Perry Alexander;Nael B. Abu-Ghazaleh

  • Affiliations:

  • Department of ECECS, University of Cincinnati, Cincinnati, OR;Department of ECECS, University of Cincinnati, Cincinnati, OR;Computer Science Department, SUNY Binghamton, Binghamton, NY

  • Venue:
  • ECBS'99 Proceedings of the 1999 IEEE conference on Engineering of computer-based systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

The complexity of modern systems is reflected in a proportiornate increase in the complexity of their design and verification. Formal analysis methods are of particular interest because they provide the mathematical foundation necessary for rigorous analysis: successful formal analysis of a system provides a high level of assurance of correctness and conformance with specifications. Unfortunately, for a number of reasons. formal analysis techniques have failed to scale to large systems. In traditional engineering disciplines, decomposition and component-based design activities have contributed substantially to effective design of large systems. Consequently. this paper presents some proof obligations that perform partial correctness checks on hierarchically designed systems. Since the obligations are applied locally, they avoid the state explosion associated with formal analysis of a large system. The obligations represent initial steps towards the goal of decompositional verification of designs.