Abstract
This chapter introduces the formal syntax and operational semantics of a simple, structured imperative language called IMP, with static variable allocation and no sophisticated declaration constructs for data types, functions, classes, methods and the like. The operational semantics is defined in the natural style and it assumes an abstract machine with a very basic form of memory to associate integer values with variables. The operational semantics is used to derive a notion of program equivalence and several examples of (in)equivalence proofs are shown.
Programs must be written for people to read, and only incidentally for machines to execute. (H. Abelson and G. Sussman).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bruni, R., Montanari, U. (2017). Operational Semantics of IMP. In: Models of Computation. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham. https://doi.org/10.1007/978-3-319-42900-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-42900-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42898-7
Online ISBN: 978-3-319-42900-7
eBook Packages: Computer ScienceComputer Science (R0)