By Topic

Using automatable proof obligations for component-based design checking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rangarajan, M. ; Dept. of Electr. Comput. & Eng. Comput. Sci., Cincinnati Univ., OH, USA ; Alexander, P. ; Abu-Ghazaleh, N.B.

The complexity of modern systems is reflected in a proportionate 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

Published in:

Engineering of Computer-Based Systems, 1999. Proceedings. ECBS '99. IEEE Conference and Workshop on

Date of Conference:

7-12 Mar 1999