Abstract
We turn to some applications of predicate logic in computing: the formal specification of imperative programs (i.e. ones that use assignment statements) and the proof and development of sequences of assignments. Skill with predicate logic can be used to reformulate English specifications, with all their vagueness and ambiguities, as formal specifications. Also, parts of assignments can be calculated instead of guessed. Finally, we discuss the conditional statement and conditional expression.
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
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gries, D., Schneider, F.B. (1993). Predicates and Programming. In: A Logical Approach to Discrete Math. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3837-7_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3837-7_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2835-1
Online ISBN: 978-1-4757-3837-7
eBook Packages: Springer Book Archive