A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Guardians and actions: linguistic support for robust, distributed programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Temporal Semantics of Concurrent Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Verification of concurrent programs: a temporal proof system
Verification of concurrent programs: a temporal proof system
Rationale for the design of the Ada programming language
ACM SIGPLAN Notices - Rationale for the deisgn of the Ada programming language
| Hi-index | 0.00 |
The focus of this paper is on the processes that control access to shared resources in concurrent systems. Processes that access a shared resource send access requests to the controller of the shared resource which in turn services requests based on such criteria as the conditions enabling the requests, the fairness specified, etc. In this paper we examine the structure of resource controllers, in particular, we show how resource controllers manifest themselves in Ada. Our prime motivation for this work is to develop schemes by which controllers with complex resource control policies can be implemented using the tasking constructs of Ada. To enable the verification of Ada resource controllers, we provide a temporal semantics for the tasking constructs as well as for the resource controller components.