Skip Navigation

The Computer Journal 1986 29(5):404-415; doi:10.1093/comjnl/29.5.404
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Barringer, H.
Right arrow Articles by Mearns, I.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Proof System for Ada* Tasks

H. Barringer § and I. Mearns §

Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, UK

An axiomatic proof system for reasoning about the basic Ada tasking constructs is presented. The proof system is based on an earlier paper by the same authors and deals with safety properties of concurrent Ada programs including freedom from deadlock. The system has been proved to be sound and relatively complete against a denotational semantics for the constructs considered.

Received March 1985.

* Ada is a registered trademark of the U.S. Government (Ada Joint Program Office).

§ Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL

Present address: Data Systems Division, Marconi Radar Systems Ltd, Writtle Road, Chelmsford CM1 3BN, England.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.