An analysis of refinement in an abortive paradigm
From MaRDI portal
Publication:851133
DOI10.1007/s00165-006-0006-3zbMath1105.68070OpenAlexW2081676304MaRDI QIDQ851133
Moshe Deutsch, Martin C. Henson
Publication date: 17 November 2006
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-006-0006-3
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Incompleteness of relational simulations in the blocking paradigm ⋮ Relational concurrent refinement. II: Internal operations and outputs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proceedings of the REFINE 2005 workshop, Guildford, UK, April 2005
- Prespecification in data refinement
- A single complete rule for data refinement
- A logic for schema-based program development
- VDM '90. VDM and Z - formal methods in software development. 3rd international symposium of VDM Europe, Kiel, FRG, April 17-21, 1990. Proceedings
- VDM '91. Formal software development methods. Vol. 1: Conference contributions. 4th international symposium of VDM Europe, Noordwijkerhout, the Netherlands, October 21-25, 1991. Proceedings
- ZB 2003: Formal specification and development in Z and B. Third international conference of B and Z users, Turku, Finland, June 4--6, 2003. Proceedings
- Power simulation and its relation to traces and failures refinement
- Revising \(Z\). I: Logic and semantics
- Revising \(Z\). II: Logical development
- Proof of correctness of data representations
- Waiting time solutions of the shallow water equations
- Refinement Calculus
- An Analysis of Total Correctness Refinement Models for Partial Relation Semantics II
- A single complete refinement rule for Z
- Data Refinement
- The specification statement
- Investigating Z
