Alessandro Avellone, et al.  Home/Search
Context
Related
| www3.oup.co.uk/igpl/Vo...Avellone.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: www3.oup.co.uk/igpl/Volum...#Marx (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The purpose of this papers to show a technique to automatically certify answers coming from a nontrustable theorem prover. As an extreme consequence, the development of non-sound theorem provers has been considered and investigated, in order to evaluate their relative eciency on particular classes of dicult theorems. (Update)
Active bibliography (related documents): More All
3.8: How to Avoid the Formal Verification of a Theorem Prover - Avellone, Benini, Moscato (2001) (Correct)
0.5: Duplication-Free Tableau Calculi Together With Cut-Free and.. - Avellone, al. (1997) (Correct)
0.5: A Formal Framework for Synthesis and Verification of.. - Avellone, Ferrari.. (2000) (Correct)
Similar documents based on text: More All
0.5: An implementation of a O(n log n)-SPACE Decision.. - Avellone, Fiorino.. (Correct)
0.2: Almost duplication-free tableau calculi for propositional Lax .. - Avellone, Ferrari (1996) (Correct)
0.2: Average-Case Analysis of Algorithms for Trace Language.. - Avellone, Bertoni.. (1995) (Correct)
BibTeX entry: (Update)
@misc{ avellone-how,
author = "Alessandro Avellone and et al.",
title = "How to Avoid the Formal Verification of a Theorem Prover",
url = "citeseer.ist.psu.edu/article/avellone01how.html" }
Citations (may not include all citations):362 ML for the Working Programmer (context) - Paulson - 1996
306 LCF considered as a programming language (context) - Plotkin - 1977
128 Logic and Computation: Interactive Proof with Cambridge LCF (context) - Paulson - 1987
104 Metamathematical Investigation of Intuitionistic Arithmetic .. (context) - Troelstra - 1973
82 volume 828 of Lecture Notes in Computer Science (context) - Paulson, Theorem - 1994
81 Why higher-order logic is a good formalism for specifying an.. (context) - Gordon - 1986
70 Mechanizing programming logics in higher order logic - Gordon - 1989
45 Cambridge University Press (context) - Huet, Plotkin et al. - 1991
31 Isabelle's object-logics - Paulson - 1997
30 space decision procedure for intuitionistic propositional lo.. (context) - Hudelmaier, log - 1993
23 Binary Decision Diagrams as a HOL derived rule (context) - Harrison - 1995
22 Contraction-free sequent calculi for intuitionistic logic (context) - Dyckho - 1992
21 Generic automatic proof tools - Paulson - 1997
10 Stalmarck's algorithm as a HOL derived rule - Harrison - 1996
9 Designing a theorem prover - Paulson - 1992
8 Avoiding duplications in tableau systems for intuitionistic .. (context) - Miglioli, Moscato et al. - 1997
6 An improved refutation system for intuitionistic predicate l.. (context) - Miglioli, Moscato et al. - 1994
6 Duplication-free tableau calculi together with cutfree and c.. - Avellone, Ferrari et al. - 1997
6 Isabelle's reference manual (context) - Paulson - 1997
5 How to avoid duplications in refutation systems for intuitio.. (context) - Miglioli, Moscato et al. - 1994
5 Seventy- ve problems for testing automatic theorem provers (context) - Pelletier - 1986
2 Tactics for translation of tableau in natural deduction (context) - Avellone, Benini et al. - 1999
2 Generalized tableau systems for intermediate propositional l.. (context) - Avellone, Miglioli et al. - 1997
2 Computer arithmetic: Logic (context) - Benini, Nowotka et al. - 1998
2 Sistemi di refutazione per logiche intermedie e modali (context) - Redaelli - 1994
2 Mechanizing program veri cation in HOL (context) - Agerholm - 1991
2 Translating tableaux into natural deduction: Applications to.. (context) - Avellone, Benini et al. - 1999
2 Veri cation and Analysis of Programs in a Constructive Envir.. (context) - Benini - 2000
1 volume 43 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Schwichtenberg, Troelstra et al. - 1996
Documents on the same site (http://www3.oup.co.uk/igpl/Volume_09/Issue_01/#Marx): More
Partiality and Games: Propositional Logic - Sandu, Pietarinen (2001) (Correct)
Theorem Proving for Untyped Constructive λ-Calculus.. - Ramsay (Correct)
Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC