Stack method in program semantics

DOI10.1007/BF02943317MaRDI QIDQ1085598zbMATH OpenOpenAlexFDO

Authors Zhaokeng Zhao, Tong Gao Tang

Publication date 1987

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02943317

zbMATH Keywords

denotational semantics with stacksPASCALPROLOG

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Review text

In this paper, we describe firstly a formal concept of stack and introduce some operational rules on it. Then we extend the denotational semantics to the denotational semantics with stacks, by which we make a formal semantics for a real PASCAL (subset) which can run on a computer. By an example of program with procedures it will be seen that our method can be used to describe the basic principles of compiling. Finally, we have succeeded in building a formal semantics model of a PROLOG (subset).

Recommendations

• scientific article; zbMATH DE number 3900130
• scientific article; zbMATH DE number 3963176
• scientific article; zbMATH DE number 4009792
• A structural approach to operational semantics
• Denotational and operational semantics for prolog

Cited in

(5)

• Further Study of a Stack-length Model
• The Computability of Stack Non-Underflow
• scientific article; zbMATH DE number 3963176 (Why is no real title available?)
• scientific article; zbMATH DE number 3978369 (Why is no real title available?)
• Compiler Construction

This page was built for publication: Stack method in program semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085598)