Object-Oriented Refinement and Proof using Behaviour Functions

Abstract

This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational category theory. The calculus aims to span the gulf between abstract specification and concrete implementation of object-oriented systems using mathematically verifiable properties and transformations. The calculus is compositional and can be used to express the behaviour of partial system views. The calculus is used to specify, analyse and refine a simple case study.

Contributors

Tony Clark

Conference

Publication date: January 2000

Publication date (Print): January 2000

Pages: 1-15

Affiliations

Department of Computing, University of Bradford

West Yorkshire, BD7 1DP, UK

Article

DOI: 10.14236/ewic/ROOM2000.2

Copyright statement: © Tony Clark. Published by BCS Learning and Development Ltd. Rigorous Object-Oriented Methods 2000

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Rigorous Object-Oriented Methods 2000

Conference acronym: ROOM

Conference number:

Conference location: York, UK

Conference date: 17 January 2000

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Rigorous Object-Oriented Methods

Product

Product Information: 1477-9358BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/ROOM2000.2

Self URI (journal page): https://ewic.bcs.org/

Categories

Series title: Electronic Workshops in Computing