We extend proof automation in an interactive theorem prover to analyze changes in
specifications and proofs. Our approach leverages the history of changes to specifications …

As the knowledge available in the computer understandable proof corpora grows,
recognizing repeating patterns becomes a necessary requirement in order to organize …

Large-scale verification projects pose particular challenges. Issues include proof
exploration, efficiency of the edit-check cycle, and proof refactoring for documentation and …

Dependently-typed functional languages are increasingly popular, but due to the complexity
of their type systems, there is still a lot of friction in the user experience, both for beginners …

Refactoring is an important Software Engineering technique for improving the structure of a
program after it has been written. Refactorings improve the maintainability, readability, and …

Complex automated proof strategies are often difficult to extract, visualise, modify, and
debug. Traditional tactic languages, often based on stack-based goal propagation, make it …

We present an abstract, set-theoretic denotational semantics for a significant subset of
OCaml and its module system, allowing to reason about the correctness of renaming value …

Refactoring, successfully used in the field of programming, can be used in maintenance and
restructuring of the large and complex models. In this paper, we present a novel approach …

In this paper we present CoqPIE (CoqPIE is available for download at http://github.
com/kendroe/CoqPIE), a new development environment for Coq which delivers editing …

We present a prototype refactoring framework based on graph rewriting and bidirectional
transformations that is designed to be generic, extensible, and declarative. Our approach …