Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article
Open access

A Refinement Strategy for Circus

Published: 01 November 2003 Publication History

Abstract

We present a refinement strategy for Circus, which is the combination of Z, CSP, and the refinement calculus in the setting of Hoare and He’s unifying theories of programming. The strategy unifies the theories of refinement for processes and their constituent actions, and provides a coherent technique for the stepwise refinement of concurrent and distributed programs involving rich data structures. This kind of development is carried out using Circus’s refinement calculus, and we describe some of its laws for the simultaneous refinement of state and control behaviour, including the splitting of a process into parallel subcomponents. We illustrate the strategy and the laws using a case study that shows the complete development of a small distributed program.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing
Formal Aspects of Computing  Volume 15, Issue 2-3
Nov 2003
195 pages
ISSN:0934-5043
EISSN:1433-299X
Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 November 2003
Published in FAC Volume 15, Issue 2-3

Author Tags

  1. Concurrency
  2. CSP
  3. Program development
  4. Z

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)38
  • Downloads (Last 6 weeks)6
Reflects downloads up to 22 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Formal Verification of BDI AgentsThe Combined Power of Research, Education, and Dissemination10.1007/978-3-031-73887-6_20(302-326)Online publication date: 23-Oct-2024
  • (2024)A Tour Through the Programming Choices: Semantics and ApplicationsThe Application of Formal Methods10.1007/978-3-031-67114-2_11(261-305)Online publication date: 1-Sep-2024
  • (2024)Uncertainty and Probabilistic UTPThe Practice of Formal Methods10.1007/978-3-031-66673-5_10(184-205)Online publication date: 4-Sep-2024
  • (2023)RoboWorld: Verification of Robotic Systems with Environment in the LoopFormal Aspects of Computing10.1145/362556335:4(1-46)Online publication date: 20-Nov-2023
  • (2023)UTP, Circus, and IsabelleTheories of Programming and Formal Methods10.1007/978-3-031-40436-8_2(19-51)Online publication date: 8-Sep-2023
  • (2022)Probabilistic modelling and verification using RoboChart and PRISMSoftware and Systems Modeling (SoSyM)10.1007/s10270-021-00916-821:2(667-716)Online publication date: 1-Apr-2022
  • (2022)Automatic Generation of Verified Concurrent Hardware Using VHDLFormal Methods: Foundations and Applications10.1007/978-3-031-22476-8_4(55-72)Online publication date: 6-Dec-2022
  • (2021)Model-Based Engineering for Robotics with RoboChart and RoboToolFormal Methods for an Informal World10.1007/978-3-031-43678-9_4(106-151)Online publication date: 6-Sep-2021
  • (2021)RoboWorld: Where Can My Robot Work?Software Engineering and Formal Methods10.1007/978-3-030-92124-8_1(3-22)Online publication date: 6-Dec-2021
  • (2020)Inputs and Outputs in CSPACM Transactions on Computational Logic10.1145/337950821:3(1-53)Online publication date: 18-May-2020
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media