A compliance notation for verifying concurrent systems

Authors:
D. M. Atiya;S. King
Affiliations:
University of York, Heslington, York, UK;University of York, Heslington, York, UK
Venue:
Proceedings of the 24th International Conference on Software Engineering
Year:
2002

Citing 6
Cited 0

Literate programming

The Computer Journal
Programming from specifications (2nd ed.)

Programming from specifications (2nd ed.)
Using Z: specification, refinement, and proof

Using Z: specification, refinement, and proof
Concurrent and Real Time Systems: The CSP Approach

Concurrent and Real Time Systems: The CSP Approach
Don't Verify, Abstract!

ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
A concurrent language for refinement

IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

The compliance notation provides a practical system where both formal and informal techniques can be employed in software verification. The notation has been successfully applied in verifying some industrial safety-critical systems, but currently it has no support for verifying concurrent systems. This research aims to extend the compliance notation with appropriate support for verifying concurrent systems.