CADE-28: THE 28TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION

A
Aaronson, Scott	Mixed Base Rewriting for the Collatz Conjecture
B
Baudon, Thaïs	Parallel Complexity of Term Rewriting Systems
Ben-Amram, Amir	Efficient Computation of Polynomial Resource Bounds for Bounded-Loop Programs Loops for which Multiphase-Linear Ranking Functions are Sufficient
D
Dershowitz, Nachum	deVrijer’s Measure for SN of λ→ in Scheme
Do Vale, Deivid	Formalizing Higher-Order Termination in Coq
Doménech, Jesús J.	Loops for which Multiphase-Linear Ranking Functions are Sufficient
E
Emrich, Frank	Modular Termination Analysis of C Programs
F
Frohn, Florian	Polynomial Loops: Termination and Beyond
Fuhs, Carsten	Parallel Complexity of Term Rewriting Systems Between Derivational and Runtime Complexity
G
Genaim, Samir	Loops for which Multiphase-Linear Ranking Functions are Sufficient
Giesl, Jürgen	Polynomial Loops: Termination and Beyond Modular Termination Analysis of C Programs Analyzing Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Gonnord, Laure	Parallel Complexity of Term Rewriting Systems
H
Hark, Marcel	Polynomial Loops: Termination and Beyond Analyzing Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Hensel, Jera	Modular Termination Analysis of C Programs
Heule, Marijn	Mixed Base Rewriting for the Collatz Conjecture
L
Lucas, Salvador	Did Turing Care of the Halting Problem?
M
Meyer, Fabian	Analyzing Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Middeldorp, Aart	Polynomial Termination over N is Undecidable
Mitterwallner, Fabian	Polynomial Termination over N is Undecidable
P
Payet, Etienne	Observing Loopingness
V
van der Weide, Niels	Formalizing Higher-Order Termination in Coq
Y
Yolcu, Emre	Mixed Base Rewriting for the Collatz Conjecture

Disclaimer | Powered by EasyChair Smart Program