The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Mauro Gargano, Mark A. Hillebrand, Dirk Leinenbach, Wolfgang J. Paul
    On the Correctness of Operating System Kernels. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:1-16 [Conf]
  2. Andrew M. Pitts
    Alpha-Structural Recursion and Induction. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:17-34 [Conf]
  3. Hasan Amjad
    Shallow Lazy Proofs. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:35-49 [Conf]
  4. Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, Steve Zdancewic
    Mechanized Metatheory for the Masses: The PoplMark Challenge. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:50-65 [Conf]
  5. Christoph Benzmüller, Chad E. Brown
    A Structured Set of Higher-Order Problems. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:66-81 [Conf]
  6. Néstor Cataño
    Formal Modeling of a Slicing Algorithm for Java Event Spaces in PVS. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:82-97 [Conf]
  7. Benjamin Grégoire, Assia Mahboubi
    Proving Equalities in a Commutative Ring Done Right in Coq. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:98-113 [Conf]
  8. John Harrison
    A HOL Theory of Euclidean Space. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:114-129 [Conf]
  9. Peter V. Homeier
    A Design Structure for Higher Order Quotients. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:130-146 [Conf]
  10. Brian Huffman, John Matthews, Peter White
    Axiomatic Constructor Classes in Isabelle/HOLCF. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:147-162 [Conf]
  11. Warren A. Hunt Jr., Matt Kaufmann, Robert Bellarmine Krug, J. Strother Moore, Eric Whitman Smith
    Meta Reasoning in ACL2. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:163-178 [Conf]
  12. Claude Marché, Christine Paulin-Mohring
    Reasoning About Java Programs with Aliasing and Frame Conditions. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:179-194 [Conf]
  13. César Muñoz, David Lester
    Real Number Calculations and Theorem Proving. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:195-210 [Conf]
  14. David A. Naumann
    Verifying a Secure Information Flow Analyzer. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:211-226 [Conf]
  15. Steven Obua
    Proving Bounds for Real Linear Programs in Isabelle/HOL. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:227-244 [Conf]
  16. Russell O'Connor
    Essential Incompleteness of Arithmetic Verified by Coq. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:245-260 [Conf]
  17. Veronika Ortner, Norbert Schirmer
    Verification of BDD Normalization. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:261-277 [Conf]
  18. Nicolas Oury
    Extensionality in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:278-293 [Conf]
  19. Tom Ridge, James Margetson
    A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:294-309 [Conf]
  20. Julien Schmaltz, Dominique Borrione
    A Generic Network on Chip Model. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:310-325 [Conf]
  21. Diana Toma, Dominique Borrione
    Formal Verification of a SHA-1 Circuit Core Using ACL2. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:326-341 [Conf]
  22. Thomas Tuerk, Klaus Schneider
    From PSL to LTL: A Formal Validation in HOL. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:342-357 [Conf]
  23. Francisco-Jesús Martín-Mateos, José-Luis Ruiz-Reina, José-Antonio Alonso, María-José Hidalgo
    Proof Pearl: A Formal Proof of Higman's Lemma in ACL2. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:358-372 [Conf]
  24. J. Strother Moore, Qiang Zhang
    Proof Pearl: Dijkstra's Shortest Path Algorithm Verified with ACL2. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:373-384 [Conf]
  25. Tobias Nipkow, Lawrence C. Paulson
    Proof Pearl: Defining Functions over Finite Sets. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:385-396 [Conf]
  26. Michael Norrish, Konrad Slind
    Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:397-408 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002