Towards formal proof script refactoring

Authors:
Iain Whiteside;David Aspinall;Lucas Dixon;Gudmund Grov
Affiliations:
School of Informatics, University of Edinburgh, Edinburgh, Scotland;School of Informatics, University of Edinburgh, Edinburgh, Scotland;Google, New York and School of Informatics, University of Edinburgh, Edinburgh, Scotland;School of Informatics, University of Edinburgh, Edinburgh, Scotland
Venue:
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Year:
2011

Citing 11
Cited 4

Refactoring object-oriented frameworks

Refactoring object-oriented frameworks
Refactoring: improving the design of existing code

Refactoring: improving the design of existing code
The UDP Calculus: Rigorous Semantics for Real Networking

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Proof Transformations for Evolutionary Formal Software Development

AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents

TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
A Survey of Software Refactoring

IEEE Transactions on Software Engineering
Presenting and Explaining Mizar

Electronic Notes in Theoretical Computer Science (ENTCS)
The Four Colour Theorem: Engineering of a Formal Proof

Computer Mathematics
seL4: formal verification of an OS kernel

Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Hiproofs: A Hierarchical Notion of Proof Tree

Electronic Notes in Theoretical Computer Science (ENTCS)
A declarative language for the coq proof assistant

TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs

Challenges and experiences in managing large-scale proofs

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
An essence of SSReflect

CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
An operational foundation for the tactic language of Coq

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Capturing hiproofs in HOL light

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose proof script refactorings as a robust tool for constructing, restructuring, and maintaining formal proof developments. We argue that a formal approach is vital, and illustrate by defining and proving correct a number of valuable refactorings in a simplified proof script and declarative proof language of our own design.