The SCEAS System
Navigation Menu

Conferences in DBLP

International Conference on Automated Deduction (CADE) (cade)
2005 (conf/cade/2005)

  1. Gilles Dowek
    What Do We Know When We Know That a Theory Is Consistent?. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:1-6 [Conf]
  2. Evelyne Contejean, Pierre Corbineau
    Reflecting Proofs in First-Order Logic with Equality. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:7-22 [Conf]
  3. Chad E. Brown
    Reasoning in Extensional Type Theory with Equality. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:23-37 [Conf]
  4. Christian Urban, Christine Tasson
    Nominal Techniques in Isabelle/HOL. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:38-53 [Conf]
  5. Brigitte Pientka
    Tabling for Higher-Order Logic Programming. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:54-68 [Conf]
  6. Kaustuv Chaudhuri, Frank Pfenning
    A Focusing Inverse Method Theorem Prover for First-Order Linear Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:69-83 [Conf]
  7. Serge Autexier
    The CoRe Calculus. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:84-98 [Conf]
  8. Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, S. Srivastava, Greta Yorsh
    Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:99-115 [Conf]
  9. Guillaume Dufay, Amy P. Felty, Stan Matwin
    Privacy-Sensitive Information Flow with JML. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:116-130 [Conf]
  10. Ting Zhang, Henny B. Sipma, Zohar Manna
    The Decidability of the First-Order Theory of Knuth-Bendix Order. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:131-148 [Conf]
  11. Jordi Levy, Joachim Niehren, Mateu Villaret
    Well-Nested Context Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:149-163 [Conf]
  12. Guillem Godoy, Ashish Tiwari
    Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:164-176 [Conf]
  13. Sean Bechhofer, Ian Horrocks, Daniele Turi
    The OWL Instance Store: System Description. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:177-181 [Conf]
  14. Boris Konev, Frank Wolter, Michael Zakharyaschev
    Temporal Logics over Transitive States. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:182-203 [Conf]
  15. Ullrich Hustadt, Boris Konev, Renate A. Schmidt
    Deciding Monodic Fragments by Temporal Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:204-218 [Conf]
  16. Viorica Sofronie-Stokkermans
    Hierarchic Reasoning in Local Theory Extensions. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:219-234 [Conf]
  17. Claudio Castellini, Alan Smaill
    Proof Planning for First-Order Temporal Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:235-249 [Conf]
  18. Andreas Meier, Erica Melis
    System Description: Multi A Multi-strategy Proof Planner. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:250-254 [Conf]
  19. Randal E. Bryant, Sanjit A. Seshia
    Decision Procedures Customized for Formal Verification. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:255-259 [Conf]
  20. Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
    An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:260-277 [Conf]
  21. Franz Baader, Silvio Ghilardi
    Connecting Many-Sorted Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:278-294 [Conf]
  22. Sean McLaughlin, John Harrison
    A Proof-Producing Decision Procedure for Real Arithmetic. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:295-314 [Conf]
  23. Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani
    The MathSAT 3 System. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:315-321 [Conf]
  24. Graham Steel
    Deduction with XOR Constraints in Security API Modelling. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:322-336 [Conf]
  25. Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick
    On the Complexity of Equational Horn Clauses. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:337-352 [Conf]
  26. Greta Yorsh, Madanlal Musuvathi
    A Combination Method for Generating Interpolants. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:353-368 [Conf]
  27. Marco Benedetti
    sKizzo: A Suite to Evaluate and Certify QBFs. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:369-376 [Conf]
  28. Tomasz Truderung
    Regular Protocols and Attacks with Regular Knowledge. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:377-391 [Conf]
  29. Peter Baumgartner, Cesare Tinelli
    The Model Evolution Calculus with Equality. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:392-408 [Conf]
  30. Christian G. Fermüller, Reinhard Pichler
    Model Representation via Contexts and Implicit Generalizations. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:409-423 [Conf]
  31. Mizuhito Ogawa, Eiichi Horita, Satoshi Ono
    Proving Properties of Incremental Merkle Trees. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:424-440 [Conf]
  32. Jian Zhang
    Computer Search for Counterexamples to Wilkie's Identity. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:441-451 [Conf]
  33. Alex Sinner, Thomas Kleemann
    KRHyper - In Your Pocket. [Citation Graph (0, 0)][DBLP]
    CADE, 2005, pp:452-457 [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