Reasoning about orchestrations of web services using partial correctness

DOI10.1007/S00165-011-0212-5zbMath1298.68177OpenAlexW2102021362MaRDI QIDQ469344

Alan Stewart, Anthony Keenan, Joaquim Gabarró

Publication date: 10 November 2014

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-011-0212-5

zbMATH Keywords

powerdomainsworld wide webspecificationpartial correctnessfixed-pointsserviceorchestrationORCpre-orders

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Internet topics (68M11)

Related Items (3)

Modelling web-service uncertainty: the angel/daemon approach ⋮ The Robustness of Periodic Orchestrations in Uncertain Evolving Environments ⋮ The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures

Uses Software

• Orc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A timed semantics of Orc
• Invariant based programming: Basic approach and teaching experiences
• A Denotational Semantical Model for Orc Language
• The Orc Programming Language
• Predicative programming Part I
• Predicative programming Part II
• Refinement Calculus
• Simulation Using Orchestration
• An axiomatic basis for computer programming
• A Language for Task Orchestration and Its Semantic Properties

This page was built for publication: Reasoning about orchestrations of web services using partial correctness