DMCA
Coalgebraic Reasoning about Classes in Object-Oriented Languages (1998)
| Venue: | In Coalgebraic Methods in Computer Science, number 11. Electronic Notes in Computer Science |
| Citations: | 12 - 0 self |
BibTeX
@INPROCEEDINGS{Jacobs98coalgebraicreasoning,
author = {Bart Jacobs},
title = {Coalgebraic Reasoning about Classes in Object-Oriented Languages},
booktitle = {In Coalgebraic Methods in Computer Science, number 11. Electronic Notes in Computer Science},
year = {1998},
pages = {231--242},
publisher = {Elsevier}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This note briefly discusses how some of the ideas developed in the theory of coalgebras are used in a front-end tool called LOOP, developed jointly in Dresden and Nijmegen, for reasoning (with a back-end theorem prover) about classes in objectoriented languages. It will describe reasoning both about object-oriented specifications and about JAVA implementations, via examples. 1 Introduction One of the key aspects of object-orientation is that objects, as instances of a class, have a private state, which can only be accessed and modified via the operations (usually called attributes and methods) of the class of the object. It is precisely this aspect which forms the starting point of the coalgebraic analysis of classes and objects in an object-oriented setting, see [10,5]: a class is seen as a coalgebra, and an object of a class as an element of the state space of the coalgebra. More precisely, a coalgebra is an operation of the form c: X ! T (X), where X is the carrier set (or state sp...
