By Topic

An interleaving symbolic execution approach for the formal verification of Ada programs with tasking

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

2 Author(s)
Harrison, L.J. ; Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA ; Kemmerer, R.A.

The use of symbolic execution to prove partial correctness and general safety properties of Ada programs is considered. Past efforts are extended by incorporating tasking proof rules into the symbolic executor, allowing Ada programs with tasking to be formally verified

Published in:

Ada Applications and Environments, 1988., Third International IEEE Conference on

Date of Conference:

23-25 May 1988