Formal Semantics of Orc Based on TLA\(^+\)

Conference paper

DOI: 10.1007/978-3-319-17404-4_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8979)
Cite this paper as:
You Z., Xue J., Hu Q., Hong Y. (2015) Formal Semantics of Orc Based on TLA\(^+\). In: Liu S., Duan Z. (eds) Structured Object-Oriented Formal Language and Method. SOFL+MSVL 2014. Lecture Notes in Computer Science, vol 8979. Springer, Cham


Concurrency is ubiquitous today. Orc provides four powerful combinators (parallel combinator, sequential combinator, pruning combinator and otherwise combinator), used to structured concurrent programming in a simple and hierarchical manner. In order to extend concurrent mechanism in our abstract sequential programming language, called Apla, we have already done some research about Orc. The paper takes a step towards this goal by presenting formal semantics of Orc based on TLA\(^+\) language. Compared with other semantics of Orc, our major concern is Orc expression’s next-state relation/action, which is ideal for expressing behavior of a sequence of states. And liveness properties of Orc expression are also elaborated by using TLA\(^+\) weak fairness. After analysis and comparison, our proposal could be simpler to illustrate specification of Orc program via the well known dining philosophers problem.


Concurrency Orc combinator Apla Formal semantics TLA\(^+\) 

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Provincial Key Laboratory for High-Performance Computing TechnologyJiangxi Normal UniversityNanchangChina
  2. 2.State International S&T Cooperation Base of Networked Supporting SoftwareJiangxi Normal UniversityNanchangChina
  3. 3.Department of Computer ScienceUniversity of LeicesterLeicesterUK

Personalised recommendations