- Proposition algebra and short-circuit logic
- Lecture Notes in Computer Science
- Pages (from-to)
- Document type
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is only evaluated if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used.
We review proposition algebra , an algebraic approach to propositional logic with side effects that models short-circuit evaluation. Proposition algebra is based on Hoare’s conditional , which is a ternary connective comparable to if-then-else. Starting from McCarthy’s notion of sequential evaluation  we discuss a number of valuation congruences on propositional statements and we introduce Hoare-McCarthy algebras as the structures that model these congruences. We also briefly discuss the associated short-circuit logics, i.e., the logics that define these congruences if one restricts to sequential binary connectives.
- go to publisher's site
- Proceedings title: Fundamentals of software engineering: 4th IPM International Conference, FSEN 2011, Tehran, Iran, April
20-22 2011: revised selected papers
Place of publication: Heidelberg
Editors: F. Arbab, M. Sirjani
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.