Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Journal of Automated Reasoning
On Using Conditional Definitions in Formal Theories
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Logical Foundations of Program Assertions: What do Practitioners Want?
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Checking Well-Formedness of Pure-Method Specifications
FM '08 Proceedings of the 15th international symposium on Formal Methods
Efficient Well-Definedness Checking
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Reasoning About Partial Functions in the Formal Development of Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
The spec# programming system: an overview
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
Term rewriting in logics of partial functions
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Classical Logic with Partial Functions
Journal of Automated Reasoning
Classical logic with partial functions
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Practical theory extension in event-B
Theories of Programming and Formal Methods
| Hi-index | 0.00 |
Partial functions are frequently used when specifying and reasoning about computer programs. Using partial functions entails reasoning about potentially ill-defined expressions. In this paper we show how to formally reason about partial functions without abandoning the well understood domain of classical two-valued predicate calculus. In order to achieve this, we extendstandard predicate calculus with the notion of well-definednesswhich is currently used to filter outpotentially ill-defined statements from proofs. The main contribution of this paper is to show how the standard predicate calculus can be extended with a new set of derivedproof rules that can be used to preservewell-definedness in order to make proofs involving partial functions less tedious to perform.