Name
Abstract | ||
|---|---|---|
Synchronous Programming (SP) is a universal computational principle that provides deterministic concurrency. The same input sequence with the same timing always results in the same externally observable output sequence, even if the internal behaviour generates uncertainty in the scheduling of concurrent memory accesses. Consequently, SP languages have always been strongly founded on mathematical semantics that support formal program analysis. So far, however, communication has been constrained to a set of primitive clock-synchronised shared memory (csm) data types, such as data-flow registers, streams and signals with restricted read and write accesses that limit modularity and behavioural abstractions. |
Year | Venue | Field |
|---|---|---|
2018 | ESOP | Programming language,Shared memory,Scheduling (computing),Concurrency,Computer science,Denotational semantics,Theoretical computer science,Data type,Program analysis,Determinacy,Modularity |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
16 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joaquin Aguado | 1 | 41 | 4.65 |
| Michael Mendler | 2 | 314 | 34.60 |
| Marc Pouzet | 3 | 433 | 35.29 |
| Partha S. Roop | 4 | 356 | 48.28 |
| Reinhard von Hanxleden | 5 | 412 | 47.20 |