A note on undefined expression values in programming logics
Information Processing Letters
Three-valued predicates for software specification and validation
Proceedings of the 2nd VDM-Europe Symposium on VDM---The Way Ahead
Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
A logical approach to discrete math
A logical approach to discrete math
Proof in VDM: a practitioner's guide
Proof in VDM: a practitioner's guide
Partial functions and logics: a warning
Information Processing Letters
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Theories of programming languages
Theories of programming languages
The Science of Programming
A Discipline of Programming
Partial Functions in a Total Setting
Journal of Automated Reasoning
Proceedings of the Z User Workshop
Formal development of correct algorithms: An example based on earley's recogniser
Proceedings of ACM conference on Proving assertions about programs
Understanding Z: A Specification Language and its Formal Semantics
Understanding Z: A Specification Language and its Formal Semantics
The connection between two ways of reasoning about partial functions
Information Processing Letters
A Practical Approach to Partiality --- A Proof Based Approach
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Behavioral interface specification languages
ACM Computing Surveys (CSUR)
Preventing arithmetic overflows in alloy
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
A semantic analysis of logics that cope with partial terms
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
| Hi-index | 0.00 |
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.