A Proof System for Ada Tasks

DOI10.1093/COMJNL/29.5.404MaRDI QIDQ3735062zbMATH OpenOpenAlexFDO

Authors Howard Barringer, I. Mearns

Publication date 1986

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/29.5.404

zbMATH Keywords

Ada tasking constructsconcurrent Ada programsdeadlockdenotational semantics

Mathematics Subject Classification ID

Theory of operating systems (68N25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• A proof system for concurrent ADA programs
• Proof theory for exception handling in a tasking environment
• A complete axiomatic semantics of spawning
• scientific article; zbMATH DE number 3902009
• scientific article; zbMATH DE number 3878340

Cited in

(7)

• An ``executable impredicative semantics for the Ada configuration
• Monitoring for Deadlock and Blocking in Ada Tasking
• scientific article; zbMATH DE number 3765722 (Why is no real title available?)
• scientific article; zbMATH DE number 2011471 (Why is no real title available?)
• scientific article; zbMATH DE number 3997140 (Why is no real title available?)
• A proof system for concurrent ADA programs
• Proof theory for exception handling in a tasking environment

Describes a project that uses

Uses Software

• Ada95

This page was built for publication: A Proof System for Ada Tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735062)