Document Type

Thesis

Degree

Master of Science (MS)

Major/Program

Computer Science

First Advisor's Name

Paul Attie

First Advisor's Committee Title

Committee Chair

Second Advisor's Name

Rida Bazzi

Third Advisor's Name

Rakesh Sinha

Fourth Advisor's Name

Michael Evangelist

Date of Defense

5-8-1996

Abstract

We address the problem of designing concurrent, reactive, nonterminating programs. Our approach to developing concurrent programs involves the use of correctness-preserving transformations to realize each step of program development. The transformations we have designed automatically guarantee the preservation of the deadlock freedom property, and hence deadlock freedom does not have to be manually verified after each development step. Since our transformations are syntactic, they are easily mechanizable as well. This makes syntactic transformations particularly appealing for the development of large, complex, and correct distributed systems, where a manual approach would be prohibitively expensive. In this work we present a set of syntactic transformations along with an example of their application to the development of a simplified mobile telephone system.

Identifier

FI14062202

Comments

If you are the rightful copyright holder of this dissertation or thesis and wish to have it removed from the Open Access Collection, please submit a request to dcc@fiu.edu and include clear identification of the work, preferably with URL.

Share

COinS
 

Rights Statement

Rights Statement

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).