Evaluating the Interfaces of Three Theorem Proving Assistants
نویسندگان
چکیده
A rst step in systematically engineering better interfaces for theorem proving assistants (TPAs) is to assess what has already been achieved in the domain. We examine three TPAs employing quite different styles of interaction. We consider the support provided by the interfaces for each of four mechanisms for eecient interactive proof: planning, reuse, reeection and articulation. Common themes are observed , as are strengths and weaknesses of the interfaces and we discuss the general issues, attempting to abstract away from the particular ar-tifacts studied.
منابع مشابه
What is Wrong with GUIs for Theorem Provers ?
Direct manipulation graphical user interfaces (GUIs) are widely available in virtually every application domain and, increasingly, for theorem proving assistants (TPAs). We argue both that the command-line based interaction paradigm has real advantages for theorem proving, and that some advantages of GUIs are diminished or even reversed for TPAs.
متن کاملTwo Modelling Approaches Applied to User Interfaces to Theorem Proving Assistants
We model the domain of formal proof without allocating speciic functions to the user or the computer. This allows us to deene key attributes of proof succinctly. Then we model some aspects of the user's interaction with a theorem proving assistant which provides automation only of the lowest level functions. This model is then used to understand some of the strengths and weaknesses of an existi...
متن کاملMaking Design Decisions to Support Diversity in InteractiveTheorem
We present a view of interactive theorem proving as a collection of diverse activities which impact on one another. We catalogue a number of features of existing theorem proving assistants (TPAs) and connect them with the activities which they seem to support. We then volunteer approaches to evaluating these features respecting the connectedness of the activities they support, and begin to make...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملThoughts on Requirements and Design Issues of User Interfaces for Proof Assistants
This position paper discusses various issues concerning requirements and design of proof assistant user interfaces (UIs). After a review of some of the difficulties faced by UI projects in academia, it presents a high-level description of proof assistant interaction. This is followed by an exposition of use cases and object identification. Several examples demonstrate the usefulness of these re...
متن کامل