Results 11  20
of
6,100
Interactive Theorem Provers from the perspective of Isabelle/Isar
"... Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interaction was introduced as a concept in computing. The main provers in use today can be traced back over 20–30 years of development. As common traits there are usually strong logical systems at the bottom, w ..."
Abstract
 Add to MetaCart
Abstract. Interactive Theorem Provers have a long tradition, going back to the 1970s when interaction was introduced as a concept in computing. The main provers in use today can be traced back over 20–30 years of development. As common traits there are usually strong logical systems at the bottom
KATML: An interactive theorem prover for Kleene Algebra with Tests
 University of Manchester
, 2003
"... Abstract. We describe an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with KAT that one finds in the literature. We illustrate its use with some examples. 1 ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. We describe an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with KAT that one finds in the literature. We illustrate its use with some examples. 1
The Abella interactive theorem prover (system description
 In Fourth International Joint Conference on Automated Reasoning
, 2008
"... Abella [3] is an interactive system for reasoning about aspects of object languages that have been formally presented through recursive rules based on syntactic structure. Abella utilizes a twolevel logic approach to specification and reasoning. One level is defined by a specification logic which s ..."
Abstract

Cited by 37 (4 self)
 Add to MetaCart
Abella [3] is an interactive system for reasoning about aspects of object languages that have been formally presented through recursive rules based on syntactic structure. Abella utilizes a twolevel logic approach to specification and reasoning. One level is defined by a specification logic which
Taclets: A New Paradigm for Constructing Interactive Theorem Provers
 CIENCIAS EXACTAS, FÍSICAS Y NATURALES, SERIE A: MATEMÁTICAS, 98(1), 2004. SPECIAL ISSUE ON SYMBOLIC COMPUTATION IN LOGIC AND ARTIFICIAL INTELLIGENCE
, 2004
"... Frameworks for interactive theorem proving give the user explicit control over the construction of proofs based on meta languages that contain dedicated control structures for describing proof construction. Such languages are not easy to master and thus contribute to the already long list of skill ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
of skills required by prospective users of interactive theorem provers. Most users, however, only need a convenient formalism that allows to introduce new rules with minimal overhead. On the the other hand, rules of calculi have not only purely logical content, but contain restrictions on the expected
Certified computer algebra on top of an interactive theorem prover
 TOWARDS MECHANIZED MATHEMATICAL ASSISTANTS. LECTURE NOTES IN COMPUTER SCIENCE
, 2007
"... We present a prototype of a computer algebra system that is built on top of a proof assistant, HOL Light. This architecture guarantees that one can be certain that the system will make no mistakes. All expressions in the system will have precise semantics, and the proof assistant will check the c ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We present a prototype of a computer algebra system that is built on top of a proof assistant, HOL Light. This architecture guarantees that one can be certain that the system will make no mistakes. All expressions in the system will have precise semantics, and the proof assistant will check the correctness of all simplifications according to this semantics. The system actually proves each simplification performed by the computer algebra system. Although our system is built on top of a proof assistant, we designed the user interface to be very close in spirit to the interface of systems like Maple and Mathematica. The system, therefore, allows the user to easily probe the underlying automation of the proof assistant for strengths and weaknesses with respect to the automation of mainstream computer algebra systems. The system that we present is a prototype, but can be straightforwardly scaled up to a practical computer algebra system.
An Improved HHL Prover: An Interactive Theorem Prover for Hybrid Systems
"... Abstract. Hybrid systems are integrations of discrete computation and continuous physical evolution. To guarantee the correctness of hybrid systems, formal techniques on modelling and verification of hybrid systems have been proposed. Hybrid CSP (HCSP) is an extension of CSP with differential equa ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ferential equations and some forms of interruptions for modelling hybrid systems, and Hybrid Hoare logic (HHL) is an extension of Hoare logic for specifying and verifying hybrid systems that are modelled using HCSP. In this paper, we report an improved HHL prover, which is an interactive theorem prover based
Taclets: A New Paradigm for Constructing Interactive Theorem Provers
"... Abstract. Frameworks for interactive theorem proving give the user explicit control over the construction of proofs based on meta languages that contain dedicated control structures for describing proof construction. Such languages are not easy to master and thus contribute to the already long list ..."
Abstract
 Add to MetaCart
list of skills required by prospective users of interactive theorem provers. Most users, however, only need a convenient formalism that allows to introduce new rules with minimal overhead. On the the other hand, rules of calculi have not only purely logical content, but contain restrictions
Formalization of Formal Topology by means of the interactive theorem prover Matita
 Proceedings CICM 2011
, 2011
"... The project entitled “Formalization of Formal Topology by means of the interactive theorem prover Matita ” is an official bilateral project between the Universities of Padova and Bologna, funded by the former, active ¡¡¡¡¡¡ ¡.mine from march 2008 until august 2010. The project brought together and e ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The project entitled “Formalization of Formal Topology by means of the interactive theorem prover Matita ” is an official bilateral project between the Universities of Padova and Bologna, funded by the former, active ¡¡¡¡¡¡ ¡.mine from march 2008 until august 2010. The project brought together
Formal metatheory of programming languages in the Matita interactive theorem prover
 Journal of Automated Reasoning: Special Issue on the Poplmark Challenge. Published online
, 2011
"... Abstract. This paper is a report about the use of Matita, an interactive theorem prover under development at the University of Bologna, for the solution of the POPLmark Challenge, part 1a. We provide three different formalizations, including two direct solutions using pure de Bruijn and locally name ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. This paper is a report about the use of Matita, an interactive theorem prover under development at the University of Bologna, for the solution of the POPLmark Challenge, part 1a. We provide three different formalizations, including two direct solutions using pure de Bruijn and locally
PG Tips: A Recommender System for an Interactive Theorem Prover
"... Interactive theorem provers require input from users to guide the proof process. Some theorems can be complicated, making it difficult to decide which direction to take at a specific point within a proof. PG Tips is a recommender system that has been incorporated into the theorem prover Isabelle’s g ..."
Abstract
 Add to MetaCart
Interactive theorem provers require input from users to guide the proof process. Some theorems can be complicated, making it difficult to decide which direction to take at a specific point within a proof. PG Tips is a recommender system that has been incorporated into the theorem prover Isabelle’s
Results 11  20
of
6,100