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