Login | Register

Graph model for object oriented programming languages


Graph model for object oriented programming languages

Chui, Patrick (2005) Graph model for object oriented programming languages. Masters thesis, Concordia University.

[thumbnail of MR10283.pdf]
Text (application/pdf)
MR10283.pdf - Accepted Version


Object-oriented programming lacks a simple theoretical foundation. This is manifested by the abundance of formal models for this programming paradigm. In its simplest form, an object can be viewed as an internal state plus a set of operations on objects. We use directed labelled graph, called state graph, to model the run-time behaviour of objects, with nodes as objects and edges as references to other objects. The graph model, based on conventional operational semantics, is natural and simple. We are then able to formulate an axiomatic semantics for reasoning about object-oriented programs. The axiomatic semantics is proved to be sound and complete with respect to the operational semantics. Our work suggests that graph is an good candidate for capturing the characteristic features of object-oriented programming languages.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Chui, Patrick
Pagination:vii, 68 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science and Software Engineering
Thesis Supervisor(s):Grogono, Peter
Identification Number:LE 3 C66C67M 2005 C48
ID Code:8706
Deposited By: Concordia University Library
Deposited On:18 Aug 2011 18:33
Last Modified:13 Jul 2020 20:04
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top