Tempo: A Declarative Concurrent Programming Language (1995) [7 citations — 5 self]
Abstract:
Tempo is a declarative concurrent programming language based on classical firstorder logic. It improves on traditional concurrent logic programming languages (e.g., Parlog) by explicitly specifying aspects of the behaviour of concurrent programs, namely their safety properties. This provides great advantages in writing concurrent programs and manipulating them while preserving correctness. The language has a procedural interpretation that allows the specification to be executed, also concurrently. Tempo is sufficiently high-level to simulate practical concurrent programming paradigms, and can act as a common framework in which algorithms for a variety of paradigms may be expressed, compared, and manipulated. 1 Introduction With the ever more widespread use of multiprocessor architectures and computer networks, the study of concurrent programming is becoming increasingly important. At the same time, concurrent programming is substantially more difficult than sequential programming: as w...
Citations
| 1730 | Maintaining Knowledge about Temporal Intervals – Allen - 1983 |
| 814 | The temporal logic of programs – Pnueli - 1977 |
| 460 | ALogic-Based Calculus of Events – Kowalski, Sergot - 1986 |
| 255 | The Family of Concurrent Logic Programming Languages – Shapiro - 1989 |
| 220 | Modeling Concurrency with Partial Orders – Pratt - 1986 |
| 190 | How to write parallel programs: A guide to the perplexed – Carriero, Gelernter - 1989 |
| 138 | Parallel Program Design – Chandy, Misra - 1988 |
| 129 | Executing Temporal Logic Programs – Moszkowski - 1986 |
| 109 | Myths about the mutual exclusion problem – Peterson - 1981 |
| 83 | An Introduction to Parallel Programming – Chandy, Taylor - 1992 |
| 44 | Design of the Kernel Language for the Parallel Inference Machine – Ueda, Chikayama - 1990 |
| 35 | Parallel Logic Programming in PARLOG – GREGORY - 1987 |
| 22 | Concurrent MetateM --- A Language for Modeling Reactive Systems – Fisher - 1993 |
| 4 | Output guards and non-determinism in CSP – Bernstein - 1980 |

