|
|
Conferences in DBLP
- Colin Stirling
Games, Automata and Matching. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:1-2 [Conf]
- Osman Hasan, Sofiène Tahar
Formalization of Continuous Probability Distributions. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:3-18 [Conf]
- Guodong Li, Konrad Slind
Compilation as Rewriting in Higher Order Logic. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:19-34 [Conf]
- Christian Urban, Stefan Berghofer, Michael Norrish
Barendregt's Variable Convention in Rule Inductions. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:35-50 [Conf]
- John Harrison
Automating Elementary Number-Theoretic Proofs Using Gröbner Bases. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:51-66 [Conf]
- Boris Motik, Rob Shearer, Ian Horrocks
Optimized Reasoning in Description Logics Using Hypertableaux. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:67-83 [Conf]
- Carsten Lutz, Frank Wolter
Conservative Extensions in the Lightweight Description Logic EL. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:84-99 [Conf]
- Gulay Ünel, David Toman
An Incremental Technique for Automata-Based Decision Procedures. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:100-115 [Conf]
- Samuli Heilala, Brigitte Pientka
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:116-131 [Conf]
- Roger Antonsen, Arild Waaler
A Labelled System for IPL with Variable Splitting. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:132-146 [Conf]
- Ashish Tiwari, Sumit Gulwani
Logical Interpretation: Static Program Analysis Using Theorem Proving. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:147-166 [Conf]
- Yeting Ge, Clark Barrett, Cesare Tinelli
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:167-182 [Conf]
- Leonardo Mendonça de Moura, Nikolaj Bjørner
Efficient E-Matching for SMT Solvers. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:183-198 [Conf]
- Maria Paola Bonacina, Mnacho Echenim
T-Decision by Decomposition. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:199-214 [Conf]
- Viktor Kuncak, Martin C. Rinard
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:215-230 [Conf]
- Markus Aderhold
Improvements in Formula Generalization. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:231-246 [Conf]
- Guillem Godoy, Sophie Tison
On the Normalization and Unique Normalization Properties of Term Rewrite Systems. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:247-262 [Conf]
- Jean-Francois Couchot, Stéphane Lescuyer
Handling Polymorphism in Automated Deduction. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:263-278 [Conf]
- Peter Höfner, Georg Struth
Automated Reasoning in Kleene Algebra. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:279-294 [Conf]
- Geoff Sutcliffe, Yury Puzis
SRASS - A Semantic Relevance Axiom Selection System. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:295-310 [Conf]
- Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv
Labelled Clauses. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:311-327 [Conf]
- Christopher Lynch, Duc-Khanh Tran
Automatic Decidability and Combinability Revisited. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:328-344 [Conf]
- K. Rustan M. Leino
Designing Verification Conditions for Software. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:345- [Conf]
- Juan Antonio Navarro Pérez, Andrei Voronkov
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:346-361 [Conf]
- Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:362-378 [Conf]
- Bernhard Beckert, Martin Giese, Reiner Hähnle, Vladimir Klebanov, Philipp Rümmer, Steffen Schlager, Peter H. Schmitt
The KeY system 1.0 (Deduction Component). [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:379-384 [Conf]
- Oleg Mürk, Daniel Larsson, Reiner Hähnle
KeY-C: A Tool for Verification of C Programs. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:385-390 [Conf]
- David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu
The Bedwyr System for Model Checking over Syntactic Expressions. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:391-397 [Conf]
- Konstantin Verchinine, Alexander V. Lyaletski, Andrey Paskevich
System for Automated Deduction (SAD): A Tool for Proof Verification. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:398-403 [Conf]
- Peter Baumgartner
Logical Engineering with Instance-Based Methods. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:404-409 [Conf]
- Adam Koprowski, Aart Middeldorp
Predictive Labeling with Dependency Pairs Using SAT. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:410-425 [Conf]
- Stephan Falke, Deepak Kapur
Dependency Pairs for Rewriting with Non-free Constructors. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:426-442 [Conf]
- Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp
Proving Termination by Bounded Increase. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:443-459 [Conf]
- Alexander Krauss
Certified Size-Change Termination. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:460-475 [Conf]
- Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin, Christopher Lynch, Ralph Eric McGregor
Encoding First Order Proofs in SAT. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:476-491 [Conf]
- Peter Baumgartner, Ulrich Furbach, Björn Pelzer
Hyper Tableaux with Equality. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:492-507 [Conf]
- Björn Pelzer, Christoph Wernhard
System Description: E-KRHyper. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:508-513 [Conf]
- Christoph Weidenbach, Renate A. Schmidt, Thomas Hillenbrand, Rostislav Rusev, Dalibor Topic
System Description: SpassVersion 3.0. [Citation Graph (0, 0)][DBLP]
CADE, 2007, pp:514-520 [Conf]
|
