CADE A

39 papers

YearTitle / Authors
2011A Connection-Based Characterization of Bi-intuitionistic Validity.
Didier Galmiche, Daniel Méry
2011A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems.
Lars Noschinski, Fabian Emmes, Jürgen Giesl
2011A Hybrid Method for Probabilistic Satisfiability.
Pavel Klinov, Bijan Parsia
2011AC Completion with Termination Tools.
Sarah Winkler, Aart Middeldorp
2011ASASP: Automated Symbolic Analysis of Security Policies.
Francesco Alberti, Alessandro Armando, Silvio Ranise
2011Advances in Proving Program Termination and Liveness.
Byron Cook
2011An Efficient Decision Procedure for Imperative Tree Data Structures.
Thomas Wies, Marco Muñiz, Viktor Kuncak
2011Automated Cyclic Entailment Proofs in Separation Logic.
James Brotherston, Dino Distefano, Rasmus Lerchedahl Petersen
2011Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings
Nikolaj S. Bjørner, Viorica Sofronie-Stokkermans
2011Automated Reasoning in
Volker Haarslev, Roberto Sebastiani, Michele Vescovi
2011Backward Trace Slicing for Rewriting Logic Theories.
María Alpuente, Demis Ballis, Javier Espert, Daniel Romero
2011Blocked Clause Elimination for QBF.
Armin Biere, Florian Lonsing, Martina Seidl
2011CSI - A Confluence Tool.
Harald Zankl, Bertram Felgenhauer, Aart Middeldorp
2011Compression of Propositional Resolution Proofs via Partial Regularization.
Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel Paleo
2011Cutting to the Chase Solving Linear Integer Arithmetic.
Dejan Jovanovic, Leonardo Mendonça de Moura
2011Deciding Security for Protocols with Recursive Tests.
Mathilde Arnaud, Véronique Cortier, Stéphanie Delaune
2011Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms.
Matthew Fredrikson, Mihai Christodorescu, Somesh Jha
2011Efficient General Unification for XOR with Homomorphism.
Zhiqiang Liu, Christopher Lynch
2011Experimenting with Deduction Modulo.
Guillaume Burel
2011Exploiting Symmetry in SMT Problems.
David Déharbe, Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel Paleo
2011Extending Sledgehammer with SMT Solvers.
Jasmin Christian Blanchette, Sascha Böhme, Lawrence C. Paulson
2011Heaps and Data Structures: A Challenge for Automated Provers.
Sascha Böhme, Michal Moskal
2011Model Evolution with Equality Modulo Built-in Theories.
Peter Baumgartner, Cesare Tinelli
2011On Transfinite Knuth-Bendix Orders.
Laura Kovács, Georg Moser, Andrei Voronkov
2011Optimized Query Rewriting for OWL 2 QL.
Alexandros Chortaras, Despoina Trivela, Giorgos B. Stamou
2011Predicate Completion for non-Horn Clause Sets.
Matthias Horbach
2011Reasoning in the OWL 2 Full Ontology Language Using First-Order Automated Theorem Proving.
Michael Schneider, Geoff Sutcliffe
2011Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems.
Chad E. Brown
2011Scala to the Power of Z3: Integrating SMT and Programming.
Ali Sinan Köksal, Viktor Kuncak, Philippe Suter
2011Sine Qua Non for Large Theory Reasoning.
Krystof Hoder, Andrei Voronkov
2011Solving Systems of Linear Inequalities by Bound Propagation.
Konstantin Korovin, Andrei Voronkov
2011Sort It Out with Monotonicity - Translating between Many-Sorted and Unsorted First-Order Logic.
Koen Claessen, Ann Lillieström, Nicholas Smallbone
2011Static Analysis of Android Programs.
Étienne Payet, Fausto Spoto
2011Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs.
André Platzer
2011System Description: SPASS-FD.
Matthias Horbach
2011The Anatomy of Equinox - An Extensible Automated Reasoning Tool for First-Order Logic and Beyond - (Talk Abstract).
Koen Claessen
2011The Matita Interactive Theorem Prover.
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi
2011Translating between Language and Logic: What Is Easy and What Is Difficult.
Aarne Ranta
2011Unification in the Description Logic
Franz Baader, Thanh Binh Nguyen, Stefan Borgwardt, Barbara Morawska