Abstract
A program is not very different from a logical formula. It is a sequence of symbols constructed according to formal syntactical rules and it has a meaning which is assigned by an interpretation of the elements of the language. In programming, the symbols are called statements or commands and the intended interpretation is an execution on a machine, rather than evaluation of a truth value. The syntax of programming languages is specified using formal systems such as BNF, but the semantics is usually informally specified.
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
Rights and permissions
Copyright information
© 2001 Springer-Verlag London
About this chapter
Cite this chapter
Ben-Ari, M. (2001). Programs: Semantics and Verification. In: Mathematical Logic for Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0335-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0335-6_9
Publisher Name: Springer, London
Print ISBN: 978-1-85233-319-5
Online ISBN: 978-1-4471-0335-6
eBook Packages: Springer Book Archive