Date of Award
2003
Document Type
Honors Thesis (Open Access)
Department
Colby College. Computer Science Dept.
Advisor(s)
Marc L. Smith
Abstract
The Tuple Space communication environment is plagued by the apparent ambiguity present in the predicate operations of Linda, the programming extension used to implement Tuple Space. It bas been shown that by using a method of reasoning which describes only sequentialized traces of events, it is unclear what a failed predicate operation actually means. Using an operational semantics model of Tuple Space, an analysis of the predicate operations using a description of events occurring simultaneously has disambiguated the meanings of the failure cases. Here an algebraic model is provided, using the Communicating Sequential Process (CSP) process algebra as a base. CSP has been extended already to describe parallel events, but a further extension is created here to allow a concrete system for reasoning about the failure cases important to us. The reasonings performed with these theoretical elements yield similar results to those of the operational semantics model. Under this analysis the meanings of the failures become clear, disambiguating the Linda predicate operations.
Keywords
Computer programming, Parallel processing (Electronic computers), Programming languages (Electronic computers) -- Semantics, LINDA (Computer system), Algebra
Recommended Citation
Burke, Kyle, "Extending CSP to disambiguate Linda predicate operations" (2003). Honors Theses. Paper 41.https://digitalcommons.colby.edu/honorstheses/41
Copyright
Colby College theses are protected by copyright. They may be viewed or downloaded from this site for the purposes of research and scholarship. Reproduction or distribution for commercial purposes is prohibited without written permission of the author.