CADE-29: 29TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION
PROGRAM

Days: Saturday, July 1st Sunday, July 2nd Monday, July 3rd Tuesday, July 4th

Saturday, July 1st

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 1: CADE Invited Talk

Invited talk

09:00
Lambda-Superposition: From Theory to Trophy (abstract)
10:00-10:30Coffee Break
10:30-12:30 Session 2: Higher Order Theorem Proving
10:30
Verification of NP-hardness for Exact Lattice Problems (abstract)
11:00
Verified Given Clause Procedures (abstract)
PRESENTER: Sophie Tourret
11:30
An Isabelle/HOL Formalization of the SCL(FOL) Calculus (abstract)
12:00
Theorem Proving in Dependently-Typed Higher-Order Logic (abstract)
PRESENTER: Colin Rothgang
12:30-14:00Lunch Break
14:00-15:30 Session 3: Applications
Chair:
14:00
Reasoning about Regular Properties: A Comparative Study (abstract)
PRESENTER: Juraj Síč
14:30
A Theory of Cartesian Arrays with Applications in Quantum Circuit Verification (abstract)
PRESENTER: Yu-Fang Chen
15:00
Formal Reasoning about Influence in Natural Sciences Experiments (abstract)
PRESENTER: Martin Lange
15:30-16:00Coffee Break
16:00-18:00 Session 4: Applications, Rewriting and Termination
16:00
An Experimental Pipeline for Automated Reasoning in Natural Language (abstract)
PRESENTER: Tanel Tammet
16:15
Proving Non-Termination by Acceleration Driven Clause Learning – Short Paper (abstract)
PRESENTER: Florian Frohn
16:30
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs (abstract)
17:00
Proving Termination of C Programs with Lists (abstract)
PRESENTER: Jürgen Giesl
17:30
Left-Linear Completion with AC Axioms (abstract)
Sunday, July 2nd

View this program: with abstractssession overviewtalk overview

10:00-10:30Coffee Break
10:30-12:30 Session 6: Proof Theory / Non-Classical Logics
10:30
A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus (abstract)
11:00
Buy One Get 14 Free: Evaluating Local Reductions for Modal Logic (abstract)
PRESENTER: Ullrich Hustadt
11:30
Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory (abstract)
12:00
COOL 2 - A Generic Reasoner for Modal Fixpoint Logics (abstract)
PRESENTER: Merlin Humml
12:15
Iscalc: an Interactive Symbolic Computation Framework (System Description) (abstract)
PRESENTER: Runqing Xu
12:30-14:00Lunch Break
14:00-15:30 Session 7: Rewriting
14:00
Confluence Criteria for Logically Constrained Rewrite Systems (abstract)
PRESENTER: Jonas Schöpf
14:30
Towards Fast Nominal Anti-Unification of Letrec-Expressions (abstract)
15:00
Incremental Rewriting Modulo SMT (abstract)
PRESENTER: Gerald Whitters
15:30-16:00Coffee Break
16:00-17:15 Session 8: SAT
16:00
SAT-Based Subsumption Resolution (abstract)
PRESENTER: Robin Coutelier
16:30
Certified Core-Guided MaxSAT Solving (abstract)
PRESENTER: Andy Oertel
17:00
A more Pragmatic CDCL for IsaSAT and targetting LLVM (abstract)
PRESENTER: Mathias Fleury
17:15-17:30Mini Break
Monday, July 3rd

View this program: with abstractssession overviewtalk overview

10:00-10:30Coffee Break
10:30-12:30 Session 12: Satisfiability Modulo Theories
Location: Room 33
10:30
Combining Combination Properties: An Analysis of Stable-infiniteness, Convexity, and Politeness (abstract)
PRESENTER: Guilherme Toledo
11:00
Choose your Colour: Tree Interpolation for Quantified Formulas in SMT (abstract)
PRESENTER: Elisabeth Henkel
11:30
QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment (abstract)
12:00
On Incremental Pre-processing for SMT (abstract)
PRESENTER: Nikolaj Bjorner
12:30-14:00Lunch Break
14:00-15:30 Session 13: Non-Classical Logics
Location: Room 33
14:00
Decidability of difference logic over the reals with uninterpreted unary predicates (abstract)
PRESENTER: Baptiste Vergain
14:30
On $P$-interpolation in local theory extensions and applications to the study of interpolation in the description logics ${\cal EL}, {\cal EL}^+$ (abstract)
15:00
Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs (abstract)
PRESENTER: Marvin Brieger
15:30-16:00Coffee Break
Tuesday, July 4th

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 14: FSCD-CADE Joint Invited Talk
Location: Room 38
09:00
Nominal Techniques for Software Specification and Verification (abstract)
10:00-10:30Coffee Break
10:30-12:00 Session 15: Superposition
Location: Room 33
10:30
Superposition with Delayed Unification (abstract)
PRESENTER: Ahmed Bhayat
11:00
Program Synthesis in Saturation (abstract)
PRESENTER: Petra Hozzová
11:30
SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning (abstract)
12:30-14:00Lunch Break