Abstract
A computer program is not very different from a logical formula. It consists of 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 the execution of the program on a computer. 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
References
K.R. Apt, F.S. de Boer, and E.-R. Olderog. Verification of Sequential and Concurrent Programs (Third Edition). Springer, London, 2009.
D. Gries. The Science of Programming. Springer, New York, NY, 1981.
C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10): 576–580, 583, 1969.
Z. Manna. Mathematical Theory of Computation. McGraw-Hill, New York, NY, 1974. Reprinted by Dover, 2003.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London
About this chapter
Cite this chapter
Ben-Ari, M. (2012). Verification of Sequential Programs. In: Mathematical Logic for Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-4129-7_15
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4129-7_15
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4128-0
Online ISBN: 978-1-4471-4129-7
eBook Packages: Computer ScienceComputer Science (R0)