How to Verify Concurrent Ada Programs. The Application of Model Checking
A. Burns and A. J. Wellings
Ada 95 is an expressive concurrent programming language with which it is possible to build complex multi-tasking applications. Much of the complexity of these applications stem from the interactions between the tasks. This paper argues that model checking tools are now mature enough that they can be used by engineers to verify the logical correctness of their tasking algorithms. The paper illustrates the approach by showing the correctness of an Ada implementation of the atomic action protocol.
Download Not Available
BibTex Entry
@article{Burns2000b,
author = {A. Burns and A. J. Wellings},
category = {languages},
journal = {Ada Letters},
number = {2},
pages = {78 - 83},
publisher = {SIGAda},
title = {How to Verify Concurrent Ada Programs. The Application of Model Checking},
volume = {XIX},
year = {2000}
}