Enhancing Theorem Prover Interfaces with Program Slice Information

Authors:
Louise A. Dennis
Affiliations:
School of Computer Science and Information Technology, University of Nottingham, Nottingham, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 7
Cited 0

Generalized algorithmic debugging and testing

ACM Letters on Programming Languages and Systems (LOPLAS)
Algorithmic Program DeBugging

Algorithmic Program DeBugging
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Proof-directed debugging

Journal of Functional Programming
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
Source-Based trace exploration

IFL'04 Proceedings of the 16th international conference on Implementation and Application of Functional Languages
Program Slicing

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an extension to theorem proving interfaces for use with proof-directed debugging and other disproof-based applications. The extension is based around tracking a user-identified set of rules to create an informative program slice. Information is collected based on the involvement of these rules in both successful and unsuccessful proof branches. This provides a heuristic score for making judgements about the correctness of any rule. A simple mechanism for syntax highlighting based on such information is proposed and a small case study presented illustrating its operation. No implementation of these ideas yet exists.