Results 1  10
of
18
User Interaction with the Matita Proof Assistant
 Journal of Automated Reasoning, Special
, 2006
"... Abstract. Matita is a new, documentcentric, tacticbased interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, mostly characterized by the organization of the library as a searchable knowledge base, the emphasis on a highquality not ..."
Abstract

Cited by 46 (14 self)
 Add to MetaCart
Abstract. Matita is a new, documentcentric, tacticbased interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, mostly characterized by the organization of the library as a searchable knowledge base, the emphasis on a highquality notational rendering, and the complex interplay between syntax, presentation, and semantics.
TAME: A PVS Interface to Simplify Proofs for Automata Models
 In Proc. User Interfaces for Theorem Provers 1998 (UITP '98
, 1998
"... Although a number of mechanical provers have been introduced and applied widely by academic researchers, these provers are rarely used in the practical development of software. For mechanical provers to be used more widely in practice, two major barriers must be overcome. First, the languages provid ..."
Abstract

Cited by 39 (12 self)
 Add to MetaCart
Although a number of mechanical provers have been introduced and applied widely by academic researchers, these provers are rarely used in the practical development of software. For mechanical provers to be used more widely in practice, two major barriers must be overcome. First, the languages provided by the mechanical provers for expressing the required system behavior must be more natural for software developers. Second, the reasoning steps supported by mechanical provers are usually at too low and detailed a level and therefore discourage use of the prover. To help remove these barriers, we are developing a system called TAME, a highlevel user interface to PVS for specifying and proving properties of automata models. TAME provides both a standard specification format for automata models and numerous highlevel proof steps appropriate for reasoning about automata models. In previous work, we have shown how TAME can be useful in proving properties about systems described as LynchVaa...
Correct and UserFriendly Implementations of Transformation Systems
, 1996
"... . We present an approach to integrate several existing tools and methods to a technical framework for correctly developing and executing program transformations. The resulting systems enable program derivations in a userfriendly way. We illustrate the approach by proving and implementing the transf ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
. We present an approach to integrate several existing tools and methods to a technical framework for correctly developing and executing program transformations. The resulting systems enable program derivations in a userfriendly way. We illustrate the approach by proving and implementing the transformation Global Search on the basis of the tactical theorem prover Isabelle. A graphical userinterface based on the XWindow toolkit Tk provides user friendly access to the underlying machinery. 1 Introduction Development by transformation is a prominent approach in formal program development (CIP [Bau + 85], PROSPECTRA [HK 93], KIDS [Smi 90]). Many case studies have proven its feasibility and demonstrated how much more abstract and useroriented developments could be achieved than using usual postverification approaches (fundamental for systems like PVS [OSR 93]). One recent case study is [KW 95]; and a prominent one is [SPW 95] where a strategic transportation scheduling algorithm is de...
DECLARE: A Prototype Declarative Proof System for Higher Order Logic
, 1997
"... This report describes DECLARE, a prototype implementation of a declarative proof system for simple higher order logic. The purpose of DECLARE is to explore mechanisms of specification and proof that may be incorporated into other theorem provers. It has been developed to aid with reasoning about ope ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
This report describes DECLARE, a prototype implementation of a declarative proof system for simple higher order logic. The purpose of DECLARE is to explore mechanisms of specification and proof that may be incorporated into other theorem provers. It has been developed to aid with reasoning about operational descriptions of systems and languages. Proofs in DECLARE are expressed as proof outlines, in a language that approximates written mathematics. The proof language includes specialised constructs for (co)inductive types and relations. The system includes an abstract/article mechanism that provides a way of isolating the process of formalization from what results, and simultaneously allow the efficient separate processing of work units. After describing the system we discuss our approach to two subsidiary issues: automation and the interactive environment provided to the user. 1 Introduction This technical report describes DECLARE, a prototype implementation of a declarative proof sy...
The CtCoq System: Design and Architecture
 FORMAL ASPECTS OF COMPUTING
, 1998
"... We present issues that arose in the design of the CtCoq userinterface for proof development. Covered issues include multiprocessing, data display, mouse interaction, and script management. ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We present issues that arose in the design of the CtCoq userinterface for proof development. Covered issues include multiprocessing, data display, mouse interaction, and script management.
Program Derivation Using the Refinement Calculator
 Theorem Proving in Higher Order Logics: 9th International Conference, volume 1125 of Lecture Notes in Computer Science
, 1996
"... . The refinement calculus provides a theory for the stepwise refinement ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
. The refinement calculus provides a theory for the stepwise refinement
Support for Interactive Theorem Proving: Some Design Principles and Their Application
 In Proc. 4th Workshop on User Interfaces for Theorem Provers (UITP’98
, 1998
"... . This paper proposes a set of guidelines for use in the design of automated support for theorem proving. In particular they are aimed at graphical user interfaces to existing interactive proof engines. The application of these guidelines to the design of a graphical user interface to Isabelle is de ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
. This paper proposes a set of guidelines for use in the design of automated support for theorem proving. In particular they are aimed at graphical user interfaces to existing interactive proof engines. The application of these guidelines to the design of a graphical user interface to Isabelle is described. 1 Introduction This paper presents a number of principles formulated to guide the design of enhancements to a graphical user interface of an interactive theorem prover. An interactive theorem prover is a tool in which a user chooses and applies proof steps to terms in a given logic, to produce theorems. The prover actually performs the proof steps and ensures that only valid chains of inference are developed. Although there are many standards and texts which provide general guidelines for designing GUIs there is great benefit in attempting to formulate principles and guidelines that are specific to the problem domain of an application. Such specific principles can be informed by th...
Implementing proof by pointing without a structure editor
 LFCS REPORT SERIES ECSLFCS97368. LFCS, UNIVERSITY OF EDINBURGH. SEE ALSO THE PROOF GENERAL
, 1997
"... A proof by pointing user interface component allows a user to direct the course of a proof assistant by selecting terms with a mouse. Such a gesture is interpreted as a highlevel tactical which triggers a sequence of lowlevel basic commands for the proof engine. The algorithm inherently relies on ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A proof by pointing user interface component allows a user to direct the course of a proof assistant by selecting terms with a mouse. Such a gesture is interpreted as a highlevel tactical which triggers a sequence of lowlevel basic commands for the proof engine. The algorithm inherently relies on a structureconscious environment; as a novelty we show how proofbypointing may easily be integrated into an interface without a structure editor. We discuss in detail the use of nested selectable text regions for user interaction, the modifications necessary to the proofengine output, and the algorithm for interpreting selections as proof commands, with particular reference to a concrete implementation using XEmacs and LEGO.
TkWinHOL: A Tool for Doing Window Inference in HOL
 In Proc. 1995 International Workshop on Higher Order Logic Theorem Proving and its Applications, Lecture
, 1995
"... Window inference is a method for contextual rewriting and refinement, supported by the HOL Window Inference Library. This paper describes a userfriendly interface for window inference. The interface permits the user to select subexpressions by pointing and clicking and to select transformations fro ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Window inference is a method for contextual rewriting and refinement, supported by the HOL Window Inference Library. This paper describes a userfriendly interface for window inference. The interface permits the user to select subexpressions by pointing and clicking and to select transformations from menus. The correctness of each transformation step is proved automatically by the HOL system. The interface can be tailored to particular userdefined theories. One such extension, for program refinement, is described. 1 Introduction Though the original purpose of the HOL system [8] was as a tool for hardware verification, it has become popular also as a basis for software verification (see for example [1, 5, 7]). However, the theories built for supporting the software development process are normally difficult to use, especially if one does not have any previous detailed knowledge of the HOL system. In order to make such theories available to a general audience, it is essential that user...
Problems Encountered in the Machineassisted Proof of Hardware
 Higher Order Logic Theorem Proving and Its Applications, Lecture Notes in Computer Science 780
, 1994
"... . We describe our experiences verifying real communications hardware using machineassisted proof. In particular we reflect on the errors found, problems encountered and the bottlenecks that slowed the progress of the proofs. We also note techniques which would alleviate the problems. Most of the pr ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. We describe our experiences verifying real communications hardware using machineassisted proof. In particular we reflect on the errors found, problems encountered and the bottlenecks that slowed the progress of the proofs. We also note techniques which would alleviate the problems. Most of the problems we discuss only become significant when large designs are verified. 1 Introduction Descriptions of formal verification projects invariably focus on the successes. However, much can also be learned from the things that slow progress. In this paper we reflect on the problems encountered in the verification of real communications hardware: the Fairisle Asynchronous Transfer Mode (ATM) switching fabrics [7]. Fairisle is an existing network, designed by the Systems Research Group in Cambridge. It was designed as a platform for research into multimedia and management issues of ATM networks, and carries real user data. The switching fabrics that we considered contain both control and data p...