A denotational semantical model for Orc language

Authors:
Qin Li;Huibiao Zhu;Jifeng He
Affiliations:
Software Engineering Institute, East China Normal University, Shanghai, China;Software Engineering Institute, East China Normal University, Shanghai, China;Software Engineering Institute, East China Normal University, Shanghai, China
Venue:
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Year:
2010

Citing 8
Cited 0

Service-Oriented Architecture: Concepts, Technology, and Design

Service-Oriented Architecture: Concepts, Technology, and Design
Real-time rewriting semantics of orc

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Reduction Semantics and Formal Analysis of Orc Programs

Electronic Notes in Theoretical Computer Science (ENTCS)
A timed semantics of Orc

Theoretical Computer Science
The Orc Programming Language

FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
A compositional trace semantics for Orc

COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
A language for task orchestration and its semantic properties

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Workflow patterns in orc

COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Orc language is a concurrency calculus proposed to study the orchestration patterns in wide area computing. Its special properties such as high concurrency and asynchronism makes it a brilliant subject to study the distributed service oriented systems. This paper proposes a denotational semantical model for Orc language. Every Orc program is formalized to a predicate. Healthiness conditions are provided to make the program domain corresponding to a specific subset of predicate domain. This model gives the same semantical interpretation to the implementations and specifications. With the refinement principle, we are able to determine whether a program satisfies its specification, which can be illustrated by theorem provers.