Browse by author
Lookup NU author(s): Professor Cliff JonesORCiD
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a number of approaches which cover up the fact that "First Order Predicate Calculus" does not handle undefined logical values. There is also at least one specific "Logic of Partial Functions" (LPF) which tackles the issue at its root by using a weaker logic. Recently, we have come to realise that LPF fits a particular way of developing programs. This paper explains why LPF is a suitable logic for "posit and prove" development and explores some problems that other approaches present. © 2005 Elsevier B.V. All rights reserved.
Author(s): Jones CB
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 5th International Workshop on Automated Verification of Critical Systems (AVoCS 2005)
Year of Conference: 2005
Pages: 3-25
ISSN: 1571-0661
Publisher: Electronic Notes in Theoretical Computer Science: Elsevier
URL: http://dx.doi.org/10.1016/j.entcs.2005.10.002
DOI: 10.1016/j.entcs.2005.10.002
