Skip Navigation

The Computer Journal 1986 29(5):423-429; doi:10.1093/comjnl/29.5.423
© 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 Dowsing, R. D.
Right arrow Articles by Elliott, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Programming a Bounded Buffer using the Object and Path Expression Constructs of Path Pascal

R. D. Dowsing and R. Elliott *

School of Information Systems, University of East Anglia, Norwich NR4 7TJ, UK

We present a number of examples of the programming of a bounded buffer using the object and path expression constructs of the language Path Pascal, taking these examples as the basis for an examination of the methods of use of path expressions as a means of specifying synchronisation requirements for concurrent processes. We compare objects and path expressions with monitors and conditions, and consider the derivation of path expressions and of informal correctness demonstrations for them. Also considered is the strategy of ‘distributing’ the synchronisation requirements for a structured object to its components, and its effects on concurrency of access to the object, on its indeterminacy of behaviour, and on implementation costs.

Received February 1985.

* To whom correspondence should be addressed.

§ School of Information Systems, University of East Anglia, Norwich NR4 7TJ


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.