CADE-28: THE 28TH INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION
WST 2021 PROGRAM
Friday, July 16th

View this program: with abstractssession overviewtalk overviewside by side with other conferences

08:00-09:00 Session 35E: WST Workshop: Invited Talk
Location: ZoomRoom 2
08:00
Efficient Computation of Polynomial Resource Bounds for Bounded-Loop Programs (abstract)
09:00-10:00 Session 36B: WST Workshop: Classical Topics in Termination
09:00
Mixed Base Rewriting for the Collatz Conjecture (abstract)
09:30
deVrijer’s Measure for SN of λ→ in Scheme (abstract)
10:00-10:30Break
10:30-12:00 Session 37E: WST Workshop: Decidability and Analysis
10:30
Polynomial Loops: Termination and Beyond (abstract)
11:00
Polynomial Termination over N is Undecidable (abstract)
11:30
Modular Termination Analysis of C Programs (abstract)
12:00-12:30Break
12:30-14:00 Session 39D: WST Workshop: Runtime Complexity
Location: ZoomRoom 2
12:30
Analyzing Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes (abstract)
13:00
Parallel Complexity of Term Rewriting Systems (abstract)
13:30
Between Derivational and Runtime Complexity (abstract)
14:00-14:30Break
14:30-16:30 Session 41D: WST Workshop: Term Rewriting and Termination Arguments
Location: ZoomRoom 2
14:30
Did Turing Care of the Halting Problem? (abstract)
15:00
Formalizing Higher-Order Termination in Coq (abstract)
15:30
Observing Loopingness (abstract)
16:00
Loops for which Multiphase-Linear Ranking Functions are Sufficient (abstract)