Unifying theories of objects

Authors:
Michael Anthony Smith;Jeremy Gibbons
Affiliations:
Oxford University, UK and Systems Assurance Group, QinetiQ, UK;Oxford University, UK
Venue:
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Year:
2007

Citing 6
Cited 1

A practical theory of programming

A practical theory of programming
Types and programming languages

Types and programming languages
A Theory of Objects

A Theory of Objects
A theory of object oriented refinement

A theory of object oriented refinement
Object-orientation in the UTP

UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Pointers and records in the unifying theories of programming

UTP'06 Proceedings of the First international conference on Unifying Theories of Programming

Unifying theories of locations

UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach to modelling Abadi-Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operational small-step evaluation rule semantics, and a corresponding UTP model with a denotational relational predicate semantics. For clarity, the UTP model is defined in terms of an operand stack, which is used to store the results of sub-programs. Models of a less operational nature are briefly discussed. The consistency of the UTP model is demonstrated by a structural induction proof over the operations of the core object calculus. Overall, our UTP model is intended to provide facilities for encoding both object-based and class-based languages.