The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The Vienna Definition Language
ACM Computing Surveys (CSUR)
Communications of the ACM
Report on the algorithmic language ALGOL 60
Communications of the ACM
Block structure (Extended Abstract): Retention or deletion?
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The equivalence of models of tasking
Proceedings of ACM conference on Proving assertions about programs
The “most recent” error: Its causes and correction
Proceedings of ACM conference on Proving assertions about programs
Correctness results for lambda calculus interpreters
Correctness results for lambda calculus interpreters
Algol-60 Implementation
Programming Languages, Information Structures, and Machine Organization.
Programming Languages, Information Structures, and Machine Organization.
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The contour model of block structured processes
ACM SIGPLAN Notices
The equivalence of sequential and associate information structure models
ACM SIGPLAN Notices
The Vienna Definition Language
ACM Computing Surveys (CSUR)
The Contour Model Lambda Calculus Machine
Proceedings of ACM conference on Proving assertions about programs
Operational specification languages
ACM '83 Proceedings of the 1983 annual conference on Computers : Extending the human resource
An overview of the PAISLey project-1984
ACM SIGSOFT Software Engineering Notes
Programming Languages The First 25 Years
IEEE Transactions on Computers
Proving a compiler correct: A simple approach
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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.