RELATIONAL MODEL FOR PROGRAM SEMANTICS
Main Author: | |
---|---|
Language: | English |
Published: |
Kent State University / OhioLINK
2008
|
Subjects: | |
Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=kent1226606883 |
id |
ndltd-OhioLink-oai-etd.ohiolink.edu-kent1226606883 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-OhioLink-oai-etd.ohiolink.edu-kent12266068832021-08-03T05:36:32Z RELATIONAL MODEL FOR PROGRAM SEMANTICS Punnam, Pradeep Kumar Computer Science Relational Model Semantics Hoare Order Smyth Order From the beginning of the development of computer programming languages, computerscientists and mathematicians have been developing methodologies to describe theprogramming languages. They use mathematics as a vehicle to describe and understand the properties of a language. Different methods of program semantic representations have been proposed to capture different aspects of programming languages. Each serves a different purpose in the understanding of a programming language. Axiomatic, denotational and operational semantics are the well known and often used methods. Axiomatic semantics is well suited for collecting the requirements for programs, and denotational semantics is useful in collecting the requirements and also proving the correctness of programs. Operational semantics gives meaning to programs by showing how programs are executed in an abstract machine; this gives essential insight into the efficiency of the language.In this thesis we develop a relational model that uses binary relations to describe computational states and programs. The relational view of specifying the programs gives us an ability to better understand the properties of programming languages using the existing mathematical theory of relations. We define orderings on states and programs using Hoare and Smyth orderings, and we define refinement and non-determinism and give their properties. We also describe some program primitives and operations and prove properties about them using our relational model. 2008-11-14 English text Kent State University / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=kent1226606883 http://rave.ohiolink.edu/etdc/view?acc_num=kent1226606883 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws. |
collection |
NDLTD |
language |
English |
sources |
NDLTD |
topic |
Computer Science Relational Model Semantics Hoare Order Smyth Order |
spellingShingle |
Computer Science Relational Model Semantics Hoare Order Smyth Order Punnam, Pradeep Kumar RELATIONAL MODEL FOR PROGRAM SEMANTICS |
author |
Punnam, Pradeep Kumar |
author_facet |
Punnam, Pradeep Kumar |
author_sort |
Punnam, Pradeep Kumar |
title |
RELATIONAL MODEL FOR PROGRAM SEMANTICS |
title_short |
RELATIONAL MODEL FOR PROGRAM SEMANTICS |
title_full |
RELATIONAL MODEL FOR PROGRAM SEMANTICS |
title_fullStr |
RELATIONAL MODEL FOR PROGRAM SEMANTICS |
title_full_unstemmed |
RELATIONAL MODEL FOR PROGRAM SEMANTICS |
title_sort |
relational model for program semantics |
publisher |
Kent State University / OhioLINK |
publishDate |
2008 |
url |
http://rave.ohiolink.edu/etdc/view?acc_num=kent1226606883 |
work_keys_str_mv |
AT punnampradeepkumar relationalmodelforprogramsemantics |
_version_ |
1719422471215513600 |