Output details
11 - Computer Science and Informatics
Newcastle University
Return to search
Output 0 of 0 in the submission
Article title
Revising basic theorem proving algorithms to cope with the logic of partial functions
Type
D - Journal article
Title of journal
Science of Computer Programming
Article number
n/a
Volume number
n/a
Issue number
-
First page of article
-
ISSN of journal
1872-7964
Year of publication
2013
Number of additional authors
2
Additional information
<10> The Logic of Partial Functions (LPF) is a long-standing framework for reasoning about partial functions. Despite intense academic interest, LPF has had limited industrial take up due to the lack of automated reasoning tools. This paper provides a unique investigation into extending fundamental theorem proving techniques to LPF. An important range of novel new insights and results for automating LPF are presented. Crucially, the work has provided the basis for ongoing work on developing the effective automated tool support for LPF and has initiated a range of further work. The paper was invited to a special SCP issue.
Interdisciplinary
-
Cross-referral requested
-
Research group
B - Concurrent Asynchronous Systems
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
