Connectors as Designs | Zendy

Meng Sun | Zendy; Farhad Arbab | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Connectors as Designs

Author(s) -

Meng Sun,

Farhad Arbab

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2009.10.028

Subject(s) - computer science , key (lock) , programming language , software engineering , equivalence (formal languages) , operational semantics , foundation (evidence) , service (business) , formal description , semantics (computer science) , theoretical computer science , mathematics , computer security , archaeology , economy , discrete mathematics , economics , history

The complex interactions that appear in service-oriented computing make coordination a key concern in service-oriented systems. Over the past years, the need for high-confidence coordination mechanisms has intensified as new technologies have appeared for the development of service-oriented applications, making formalization of coordination mechanisms critical. Unifying Theories of Programming (UTP) provide a formal semantic foundation not only for programming languages but also for various expressive specification languages. A key concept in UTP is design: the familiar pre/post-condition pair that describes the contract. In this paper we use UTP to formalize Reo connectors, whereby connectors are interpreted by designs in UTP. This model can be used as a reference document for developing tool support for Reo, such as a test case generator. It can also be used as a semantic foundation for proving properties of connectors, such as equivalence and refinement relations between connectors

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research