TY - JOUR
T1 - A UTP semantic model for Orc language with execution status and fault handling
AU - Li, Qin
AU - Zhao, Yongxin
AU - Zhu, Huibiao
AU - He, Jifeng
N1 - Publisher Copyright:
© 2014, Higher Education Press and Springer-Verlag Berlin Heidelberg.
PY - 2014/10/31
Y1 - 2014/10/31
N2 - The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics.
AB - The Orc language is a concurrency calculus proposed to study the orchestration patterns in service oriented computing. Its special features, such as high concurrency and asynchronism make it a brilliant subject for studying web applications that rely on web services. The conventional semantics for Orc does not contain the execution status of services so that a program cannot determine whether a service has terminated normally or halted with a failure after it published some results. It means that this kind of failure cannot be captured by the fault handler. Furthermore, such a semantic model cannot establish an order saying that a program is better if it fails less often. This paper employs UTP methods to propose a denotational semantic model for Orc that contains execution status information. A failure handling semantics is defined to recover a failure execution back to normal. A refinement order is defined to compare two systems based on their execution failures. Based on this order, a system that introduces a failure recovery mechanism is considered better than one without. An extended operational semantics is also proposed and proven to be equivalent to the denotational semantics.
KW - Orc language
KW - denotational semantics
KW - operational semantics
KW - service oriented computing
KW - unifying theories of programming
UR - https://www.scopus.com/pages/publications/85027923876
U2 - 10.1007/s11704-014-3385-2
DO - 10.1007/s11704-014-3385-2
M3 - 文章
AN - SCOPUS:85027923876
SN - 2095-2228
VL - 8
SP - 709
EP - 725
JO - Frontiers of Computer Science
JF - Frontiers of Computer Science
IS - 5
ER -