Abstract
In the previous chapter we showed how to reason about predicates and sets in general. In programming, predicates arise in two different disguises. First, they are used to describe control structures with branching, like conditional statements and loops. Second, they are used to express correctness conditions for programs. In both cases, the predicates are expressed in terms of program variables, so they are really Boolean expressions. In this chapter, we will look more closely at Boolean expressions and at how to reason about their properties.
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
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Back, RJ., von Wright, J. (1998). Boolean Expressions and Conditionals. In: Refinement Calculus. Graduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1674-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1674-2_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-98417-9
Online ISBN: 978-1-4612-1674-2
eBook Packages: Springer Book Archive