1990
DOI: 10.1109/71.80163
|View full text |Cite
|
Sign up to set email alerts
|

A UNITY-style programming logic for shared dataspace programs

Abstract: The term shared dataspace refers to the general class of programming languages in which the principal means of communication among the concurrent components of programs is a common, content-addressable data structure called a dataspace. In the programming language and artificial intelligence communities, there is considerable interest in such languages, e.g., logic-based languages, production rule systems, and the Linda language. However, these languages have not been the subject of extensive program verificat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

1990
1990
2004
2004

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 37 publications
(13 citation statements)
references
References 18 publications
0
13
0
Order By: Relevance
“…This is, in part, because we see Swarm, not so much as a language, but as a framework for investigating concurrency paradigms and languages. This work forms the basis for further investigation of programming methodologies [29], proof systems [12,13,30], and approaches to program visualization [28].…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…This is, in part, because we see Swarm, not so much as a language, but as a framework for investigating concurrency paradigms and languages. This work forms the basis for further investigation of programming methodologies [29], proof systems [12,13,30], and approaches to program visualization [28].…”
Section: Discussionmentioning
confidence: 99%
“…The reader interested in how one might verify this program with respect to the earlier problem specification may turn to [12] or [13].…”
Section: Label(p ) ≡mentioning
confidence: 99%
See 2 more Smart Citations
“…We also aim at being able to compare the two paradigms, but we take a more unifying perspective: we consider both as being particular instances of the more general distributed dataspace model and express them in the same framework. [10] was the first attempt to use a Unity-like logic to reason on a shared dataspace coordination model (Swarm). [19] has goals similar to ours.…”
Section: Introductionmentioning
confidence: 99%