Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
The formal semantics of programming languages: an introduction
The formal semantics of programming languages: an introduction
Distributed and Parallel Databases
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards a Formal Foundation to Orchestration Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
A language for task orchestration and its semantic properties
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
A denotational semantical model for Orc language
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
| Hi-index | 0.00 |
Orc [9] is a language for task orchestration. It has a small set of primitives, but sufficient to express many useful programs succinctly. We identify an ambiguity in the trace semantics of Kitchin et al. [9]. We give possible interpretations of the ambiguous definition and show that the semantics is not adequate regardless of the interpretation. We remedy this situation by providing new operational and denotational semantics with a better treatment of variable binding, and proving an adequacy theorem to relate them. Also, we investigate strong bisimulation in Orc and show that bisimulation implies trace equivalence but not vice versa.