Showing papers on "Denotational semantics published in 1972"

Fixpoint approach to the theory of computation

Abstract: Following the fixpoint theory of Scott, the semantics of computer programs are defined in terms of the least fixpoints of recursive programs. This allows not only the justification of all existing verification techniques, but also their extension to the handling, in a uniform manner of various properties of computer programs, including correctness, termination, and equivalence.

Operational semantics of programming languages

Abstract: A framework is developed for the operational characterization of the semantics of computational formalisms such as programming languages, digital computers and automata. Operational semantics is contrasted with input-output semantics and it is shown that input-output semantics is inappropriate to the study of certain important implementation-dependent attributes of computational formalisms. Notions of equivalence are developed for a very general class of operational models called information structure models. The structure of proofs of compiler correctness and interpreter equivalence is discussed independently of the form of the states and state transitions of a specific interpreter. These techniques are then applied to defining a correctness criterion for block structure implementations and to correctness proofs of interpreters for block structure languages.

A model for the formal definition of programming languages

Abstract: An operational model which allows the complete formal definition of the full syntax and, particularly, semantics of programming languages is described. Both its syntactic and semantic parts are based on so-called linked-forest manipulation systems which allow the definition of mappings on forests. The idea of “linking” is crucial for the given model, we represent not only abstract programs but also intermediate states of our system (abstract computer) by labelled forests with pointers.

Formal semantics and the logical structure of programming languages

Abstract: In presenting the dissertation as a partial fulfillment of the requirements for an advanced degree from the Georgia Institute of Technology, I agree that the Library of the Institute shall make it available for inspection and circulation in accordance with its regulations governing material ft o^^y^S 3T^»-V * • ?&&? that permission to copy from, or to-rfrooi this dissertation may be granted by the pltf BFroder whose direction it was written, or, in his absence, by the Dean of the Graduate Division when such copying or publication is solely for scholarly purposes and does not involve potential financial gain. It is understood that any copying from, or publication of, this dis-sertation which involves potential financial gain will not be allowed without written permission. • J ii ACKNOWLEDGMENTS I would first like to thank Professor Vladimir Slamecka, whose interest and assistance during my graduate career often went beyond the call of duty and who helped make my stay at Georgia Tech so profitable. The members of my guidance and reading committees, Professors Grosky, Gwynn and Kelly, deserve my thanks for their helpful criticism and encouragement during my research. In addition, John Gehl and Professor James Gough aided in the proofreading of two drafts of this thesis. I would also like to thank Professor Bas C. van Fraassen of the University of Toronto for reading and commenting on two drafts of this dissertation. It was Professor van Fraassen's excellent textbook on formal semantics which inspired the point of view presented here. My thesis advisor, Professor Lucio Chiaraviglio, has been of inestimable help to me. Not only are his many contributions on logical matters evidenced here, but his work as a teacher and a scholar and his friendship have left a lasting impression on me. Finally, I am most indebted to my wife, Diajie. Her patience, encouragement and aid during three years of graduate school could never be repaid, and were appreciated more than she ever knew. I also thank her for her expert typing of this dissertation.