The Library
AN EXTENSIONAL TREATMENT OF LAZY DATA-FLOW DEADLOCK
Tools
UNSPECIFIED (1995) AN EXTENSIONAL TREATMENT OF LAZY DATA-FLOW DEADLOCK. In: Workshop on Topology and Completion in Semantics, CHARTRES, FRANCE, NOV 18-20, 1993. Published in: THEORETICAL COMPUTER SCIENCE, 151 (1). pp. 195-205. ISSN 0304-3975.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Abstract
In an extensional treatment of dataflow deadlock Wadge (1981) introduced an elegant nonoperational test for proving that many of Kahn's data flow message passing networks (Kahn, 1974) must be free of deadlock; a test that ''should extend to a much wider context'' in the study of program correctness. Such a context has now been provided with the introduction of partial metric spaces (Matthews, 1992). These spaces can be used to describe semantic domains such as those used in lazy data flow languages (Wadge and Ashcroft, 1985). This paper develops Wadge's ideas on establishing an extensional theory of program correctness by using partial metric spaces to give a nonoperational treatment of lazy data flow deadlock.
Item Type: | Conference Item (UNSPECIFIED) | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Journal or Publication Title: | THEORETICAL COMPUTER SCIENCE | ||||
Publisher: | ELSEVIER SCIENCE BV | ||||
ISSN: | 0304-3975 | ||||
Official Date: | 13 November 1995 | ||||
Dates: |
|
||||
Volume: | 151 | ||||
Number: | 1 | ||||
Number of Pages: | 11 | ||||
Page Range: | pp. 195-205 | ||||
Publication Status: | Published | ||||
Title of Event: | Workshop on Topology and Completion in Semantics | ||||
Location of Event: | CHARTRES, FRANCE | ||||
Date(s) of Event: | NOV 18-20, 1993 |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |