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

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.<
>