Accession Number : ADA015842


Title :   Path Expressions


Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE


Personal Author(s) : Habermann, A N


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a015842.pdf


Report Date : Jun 1975


Pagination or Media Count : 39


Abstract : Traditionally, synchronization of concurrent processes is coded in line by operations on semaphores or similar objects. Path expressions move the responsibility of implementing such restrictions from the programmer to a compiler. The programmer specifies as part of a type definition which execution sequences are permitted. The advantage of using path experssions instead of P, V operations on semaphores (or similar operations) is comparable to the advantage of using for- and while-statements instead of JUMP or BRANCH instructions. In this paper the rules for writing a path expression are described, parsing and implementation are discussed and the use of path expressions is shown by a number of examples.


Descriptors :   *COMPUTER PROGRAMMING , COMPILERS , INSTRUCTION MANUALS , NETWORK FLOWS


Subject Categories : Computer Programming and Software


Distribution Statement : APPROVED FOR PUBLIC RELEASE