Referenced Items are not available for this document.
Two different approaches that use symbolic execution were used to prove partial correctness and general safety properties of Ada programs. One approach is based on interleaving the task components while the other is based on verifying the tasks in isolation and then performing cooperation proofs. Both approaches extend past efforts by incorporating tasking proof rules into the symbolic executor, allowing Ada programs with tasking to be formally verified. The limitations of each approach are presented, along with each approach's advantages and disadvantages. In particular, the difficulty of dealing with communication statements in a loop structure is addressed in detail
Published in:
Software Testing, Verification, and Analysis, 1988., Proceedings of the Second Workshop on
Date of Conference: 19-21 Jul 1988
- Page(s):
- 114 - 122
- Meeting Date :
- 19 Jul 1988-21 Jul 1988
- Print ISBN:
- 0-8186-0868-4
- INSPEC Accession Number:
- 3248241
- Conference Location :
- Banff, Alta.
- Digital Object Identifier :
- 10.1109/WST.1988.5363
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
