- 6/9/08 -- Course Introduction
- 6/16/08 -- Literature Searching at KSU
- 6/18/08 -- Student Presentations
- Speaker: Pradeep Punnam, Title: "RELATIONAL MODEL FOR PROGRAM SEMATICS"
- 6/23/08 -- Writing a Research Paper
- 6/25/08 -- Publishing Venues
- 6/30/08 -- MS Thesis, PhD Dissertation, & The Defense
- 7/02/08 -- Giving a Good Research Presentation - Dr. Jonathan Maletic
- 7/07/08 -- Student Presentations
- Speaker: Najla Alam, Title: "A Short Survey on Wireless Sensor Networks"
- Speaker: Aaron Hagan, Title: "Using the Lattice Boltzmann method for volume image segmentation"
- 7/09/08 -- Student Presentations
- Speaker: Fan Chen, Title: "LBM Implementation on GPU using CUDA"
- Speaker: Rizal (Joey) Nor, Title: "Hardware Sensor Emulation for Wireless Sensor Network
Testbed"
|
- Pradeep Punnam, "RELATIONAL MODEL FOR PROGRAM SEMATICS"
Abstract: From the beginning of the development of computer programming languages, computer scientists and mathematicians have been developing methodologies to describe the programming 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 presentation we are going to talk about 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 refinement and step relations on programs to give an operational semantics view using relations. We also describe some primitive program operations and prove properties about them using our relational model.
- Slot 2
- Slot 3
- Slot 4
- Slot 5
|
Resources (Giving Presentations)
- Sample Presentation
- Oganization
- Mechanics
Resources (General)
|
Resources (Writing Papers)
- Literature Searching
- Format
- Organization
- Mechanics
- Ethical Concerns
|