Conferences in DBLP

International Conference on Theorem Proving in Higher Order Logics (tphol)
2002 (conf/tphol/2002)

1. Ricky W. Butler
   Formal Methods at NASA Langley. [Citation Graph (0, 0)][DBLP]
   TPHOLs, 2002, pp:1-2 [Conf]
   
2. Gérard P. Huet
   Higher Order Unification 30 Years Later. [Citation Graph (0, 0)][DBLP]
   TPHOLs, 2002, pp:3-12 [Conf]
   
3. Simon Ambler, Roy L. Crole, Alberto Momigliano
   Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction. [Citation Graph (0, 0)][DBLP]
   TPHOLs, 2002, pp:13-30 [Conf]
   
4. Gilles Barthe, Pierre Courtieu
   Efficient Reasoning about Executable Specifications in Coq. [Citation Graph (0, 0)][DBLP]
   TPHOLs, 2002, pp:31-46 [Conf]
   
5. David A. Basin, Stefan Friedrich, Marek Gawkowski
   Verified Bytecode Model Checkers. [Citation Graph (0, 0)][DBLP]
   TPHOLs, 2002, pp:47-66 [Conf]
   
6. Gertrud Bauer, Tobias Nipkow
   The 5 Colour Theorem in Isabelle/Isar. [Citation Graph (0, 0)][DBLP]
   TPHOLs, 2002, pp:67-82 [Conf]
   
7. Yves Bertot, Venanzio Capretta, Kuntal Das Barman
   Type-Theoretic Functional Semantics. [Citation Graph (0, 0)][DBLP]
   TPHOLs, 2002, pp:83-98 [Conf]
   
8. Achim D. Brucker, Burkhart Wolff
   A Proposal for a Formal OCL Semantics in Isabelle/HOL. [Citation Graph (0, 0)][DBLP]
   TPHOLs, 2002, pp:99-114 [Conf]
   
9. Judicaël Courant
   Explicit Universes for the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
   TPHOLs, 2002, pp:115-130 [Conf]
   
10. Jeremy E. Dawson, Rajeev Goré
    Formalised Cut Admissibility for Display Logic. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:131-147 [Conf]
    
11. Christophe Dehlinger, Jean-François Dufourd
    Formalizing the Trading Theorem for the Classification of Surfaces. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:148-163 [Conf]
    
12. David Delahaye
    Free-Style Theorem Proving. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:164-181 [Conf]
    
13. Louise A. Dennis, Alan Bundy
    A Comparison of Two Proof Critics: Power vs. Robustness. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:182-197 [Conf]
    
14. Amy P. Felty
    Two-Level Meta-reasoning in Coq. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:198-213 [Conf]
    
15. Michael J. C. Gordon
    PuzzleTool : An Example of Programming Computation and Deduction. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:214-229 [Conf]
    
16. Joe Hurd
    A Formal Approach to Probabilistic Termination. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:230-245 [Conf]
    
17. Micaela Mayero
    Using Theorem Proving for Numerical Analysis (Correctness Proof of an Automatic Differentiation Algorithm). [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:246-262 [Conf]
    
18. Aleksey Nogin
    Quotient Types: A Modular Approach. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:263-280 [Conf]
    
19. Aleksey Nogin, Jason Hickey
    Sequent Schema for Derived Rules. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:281-297 [Conf]
    
20. Virgile Prevosto, Damien Doligez, Thérèse Hardin
    Algebraic Structures and Dependent Records. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:298-313 [Conf]
    
21. Klaus Schneider
    Proving the Equivalence of Microstep and Macrostep Semantics. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:314-331 [Conf]
    
22. Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
    Weakest Precondition for General Recursive Programs Formalized in Coq. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:332-348 [Conf]