Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
326,644
The Matita Interactive Theorem Prover
"... Abstract. Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Its stable version 0.5.x may be downloaded at ..."
Abstract
-
Cited by 21 (9 self)
- Add to MetaCart
Abstract. Matita is an interactive theorem prover being developed by the Helm team at the University of Bologna. Its stable version 0.5.x may be downloaded at
Exploiting Parallelism in Interactive Theorem Provers
- Proceedings of TPHOLs, volume 1479 of LNCS
, 1998
"... . This paper reports on the implementation and analysis of the MP refiner, the first parallel interactive theorem prover. The MP refiner is a shared memory multi-processor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the refiner. The MP refiner is a co ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
. This paper reports on the implementation and analysis of the MP refiner, the first parallel interactive theorem prover. The MP refiner is a shared memory multi-processor implementation of the inference engine of Nuprl. The inference engine of Nuprl is called the refiner. The MP refiner is a
Multi-threading in an Interactive Theorem Prover
, 1999
"... s and compressed postscript files are available via http://svrc.it.uq.edu.au Multi-threading in an Interactive Theorem Prover Phil Cook Peter Robinson Abstract The Ergo theorem prover is an interactive prover that is currently being used by the SVRC for carrying out proofs associated with the ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
s and compressed postscript files are available via http://svrc.it.uq.edu.au Multi-threading in an Interactive Theorem Prover Phil Cook Peter Robinson Abstract The Ergo theorem prover is an interactive prover that is currently being used by the SVRC for carrying out proofs associated
STUqENT USE OF AN INTERACTIVE THEOREM PROVER
"... This article focuses on the use of an interactive theorem prover by students in a course on axiomatic set theory. The framework of use is described and then a number of student proofs are presented with comments and explanations. The last part of the article concentrates on feasible ways of improvin ..."
Abstract
- Add to MetaCart
This article focuses on the use of an interactive theorem prover by students in a course on axiomatic set theory. The framework of use is described and then a number of student proofs are presented with comments and explanations. The last part of the article concentrates on feasible ways
Dependency Graphs for Interactive Theorem Provers
, 2000
"... We propose tools to visualize large proof developments as graphs of theorems and definitions where edges denote the dependency between two theorems. In particular, we study means to limit the size of graphs. Experiments have been done with the Coq theorem prover [DFH + 93] and the GraphViz [EGKN] an ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
We propose tools to visualize large proof developments as graphs of theorems and definitions where edges denote the dependency between two theorems. In particular, we study means to limit the size of graphs. Experiments have been done with the Coq theorem prover [DFH + 93] and the GraphViz [EGKN
Trusted Extensions of Interactive Theorem Provers: Workshop Summary
"... Abstract. A fundamental strength of interactive theorem provers (ITPs) is the high degree of trust one can place in formalizations carried out in them. ITPs are usually also extensible, both at the logic level and at the implementation level. There is consequently a substantial body of ex-isting and ..."
Abstract
- Add to MetaCart
Abstract. A fundamental strength of interactive theorem provers (ITPs) is the high degree of trust one can place in formalizations carried out in them. ITPs are usually also extensible, both at the logic level and at the implementation level. There is consequently a substantial body of ex
The demonstration interactive theorem prover Demo3.3
, 1993
"... This paper describes the prototype interactive theorem prover demo3.3. The prototype demonstrates several proposals for increasing the efficiency and convenience of interactive deductive reasoning. These include: the use of a very high-level logic programming language (Qu-Prolog) for implementation, ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
This paper describes the prototype interactive theorem prover demo3.3. The prototype demonstrates several proposals for increasing the efficiency and convenience of interactive deductive reasoning. These include: the use of a very high-level logic programming language (Qu-Prolog) for implementation
Embedding imperative synchronous languages in interactive theorem provers
- In International Conference on Application of Concurrency to System Design (ICACSD 2001
, 2001
"... We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predi-cates that describe entering conditions, conditions for in-ternal moves, and termination conditions. The data flow is based on t ..."
Abstract
-
Cited by 38 (26 self)
- Add to MetaCart
on the extraction of guarded commands. This defini-tion principle can be applied to any imperative synchronous language like Esterel or some statechart variants. Follow-ing this definition principle, we have embedded our lan-guageQuartz (an Esterel variant) in the interactive theorem prover HOL. We use
Automated Specification Analysis Using an Interactive Theorem Prover
"... Abstract—A method for analyzing designs and their specifications is presented. The method makes essential use of an interactive theorem prover, but is fully automatic. Given a design and a specification, the method returns one of three possible answers. It can report that the design does not satisfy ..."
Abstract
- Add to MetaCart
Abstract—A method for analyzing designs and their specifications is presented. The method makes essential use of an interactive theorem prover, but is fully automatic. Given a design and a specification, the method returns one of three possible answers. It can report that the design does
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
Results 1 - 10
of
326,644
