Formal specifications of debuggers

Authors:
Ming-Yuan Zhu
Affiliations:
CoreTek Systems, Inc., Beijing, People's Republic of China
Venue:
ACM SIGPLAN Notices
Year:
2001

Citing 6
Cited 1

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
The calculus of constructions

Information and Computation - Semantics of Data Types
AUTO STAR—a software development system

ACM SIGPLAN Notices
The Denotational Description of Programming Languages: An Introduction

The Denotational Description of Programming Languages: An Introduction
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational semantics of programming languages and compiler generation in PowerEpsilon

ACM SIGPLAN Notices

Partitioning based operating system: a formal model

ACM SIGOPS Operating Systems Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Programming in constructive type theory corresponds to theorem proving in mathematics: the specification plays the role of the proposition to be proved and the program is obtained from the proof. In this paper, we present an approach of using constructive type theory to derive a debugger of a given programming language from its denotational semantic definition. The development is supported by a proof development system called PowerEpsilon.