Abstract | ||
---|---|---|
We propose a taxonomy of preemptive (suspensive and abortive) operators capturing the intuition of such operators that exist in the various synchronous languages. Some of the main contributions of the paper are: a precise notion of preemption is established at a structural level; we show that the class of suspensive operators is strictly more expressive than abortive operators, and we show that suspension is primitive while abortion is not. The proof techniques relies on a syntactic approach, based on SOS-specification formats, to categorize the different preemption features; also an equivalence criterion between operators specifications is proposed to provide us with expressive power measurement. |
Year | DOI | Venue |
---|---|---|
1998 | 10.1007/3-540-49366-2_11 | ADVANCES IN COMPUTING SCIENCE-ASIAN' 98 |
Field | DocType | Volume |
Operational semantics,Preemption,Programming language,Computer science,Intuition,Operator (computer programming),Parsing,Syntax,Canonical decomposition,Expressivity | Conference | 1538 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.44 |
References | Authors | |
13 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sophie Pinchinat | 1 | 194 | 23.96 |
Éric Rutten | 2 | 255 | 30.50 |
R. K. Shyamasundar | 3 | 777 | 118.76 |