Simpler Reasoning About System Properties: a Proof-by-Refinement Technique

Authors:
D. Atiya;S. King;J. C. P. Woodcock
Affiliations:
Department of Computer Science, University of York, York, UK;Department of Computer Science, University of York, York, UK;Department of Computer Science, University of York, York, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 7
Cited 1

The specification statement

ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming from specifications (2nd ed.)

Programming from specifications (2nd ed.)
A Discipline of Programming

A Discipline of Programming
Formal Development of Reactive Systems: Case Study Production Cell

Formal Development of Reactive Systems: Case Study Production Cell
How to Combine Z with Process Algebra

ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
The Semantics of Circus

ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Refinement in Circus

FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right

Verifying security properties of internet protocol stacks: The split verification approach

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proofs about system specifications are difficult to conduct, particularly for large specifications. Using abstraction and refinement, we propose a proof technique that simplifies these proofs. We apply the technique to Circus (a combination of Z and CSP) specifications of different complexities. Interestingly, all the proofs are conducted in Z, even those concerning reactive behaviour.