Coq supports a range of built-in tactics, which are engineered primarily to support backward
reasoning. Starting from a desired goal, the Coq programmer can use these tactics to …

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 …

Many modern program verifiers are based on automated theorem provers, which enable full
hiding of proof details and allow users to focus all their effort on the program text. This has …

The computer revolution is a revolution in the way we think and in the way we express what
we think. The essence of this change is the emergence of what might best be called …

This book presents new techniques that allow the automatic verification and generation of
abstract human-style proofs. The core of this approach builds an efficient calculus that works …

The object of this thesis is the study of the ability of the Coq system to mix proofs and
programs in practice. Our approach consists in implementing part of the program Kenzo, a …

The use of a functional language to implement proof strategies as proof tactics in interactive
theorem provers, often provides short, concise and elegant implementations. Whilst being …

Interactive theorem provers are tools designed for the certification of formal proofs
developed by means of man-machine collaboration. Formal proofs obtained in this way …

The ability to automatically generalise (interactive) proofs and use such generalisations to
discharge related conjectures is a very hard problem which remains unsolved. Here, we …

In questo lavoro di tesi verra discussa l'implementazione del linguaggio dichiarativo del
dimostratore interattivo di Teoremi Matita nella versione 0.99. x. Il linguagigo dichiarativo è …