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

This page contains an index consisting of author-provided keywords.

A
Asymptotically-tight	Efficient Computation of Polynomial Resource Bounds for Bounded-Loop Programs
Automatic Complexity Analysis	Analyzing Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
C
C Programs	Modular Termination Analysis of C Programs
Closed Forms	Polynomial Loops: Termination and Beyond
collatz conjecture	Mixed Base Rewriting for the Collatz Conjecture
Complexity Analysis	Polynomial Loops: Termination and Beyond Parallel Complexity of Term Rewriting Systems
computer-assisted mathematics	Mixed Base Rewriting for the Collatz Conjecture
Coq	Formalizing Higher-Order Termination in Coq
D
Decidability of Termination	Polynomial Loops: Termination and Beyond
derivational complexity	Between Derivational and Runtime Complexity
deVrijer’s proof	deVrijer’s Measure for SN of λ→ in Scheme
Disjunctive	Efficient Computation of Polynomial Resource Bounds for Bounded-Loop Programs
E
Expected Runtimes	Analyzing Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Expected Sizes	Analyzing Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
F
formalization	Formalizing Higher-Order Termination in Coq
H
Halting Problem	Did Turing Care of the Halting Problem? Polynomial Loops: Termination and Beyond
higher-order rewriting	Formalizing Higher-Order Termination in Coq
L
Linear constraint loops	Loops for which Multiphase-Linear Ranking Functions are Sufficient
LLVM	Modular Termination Analysis of C Programs
Logic programming	Observing Loopingness
Loop	Observing Loopingness
M
matrix interpretations	Mixed Base Rewriting for the Collatz Conjecture
modularity	Modular Termination Analysis of C Programs
Multiphase-linear ranking functions	Loops for which Multiphase-Linear Ranking Functions are Sufficient
Multivariate	Efficient Computation of Polynomial Resource Bounds for Bounded-Loop Programs
N
Non-Termination	Observing Loopingness
P
parallelism	Parallel Complexity of Term Rewriting Systems
Polynomial bounds	Efficient Computation of Polynomial Resource Bounds for Bounded-Loop Programs
Polynomial Loops	Polynomial Loops: Termination and Beyond
polynomial termination	Polynomial Termination over N is Undecidable
Positive Almost Sure Termination	Analyzing Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Probabilistic Integer Programs	Analyzing Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
R
Recursion	Modular Termination Analysis of C Programs
rewriting	Parallel Complexity of Term Rewriting Systems
runtime complexity	Between Derivational and Runtime Complexity
S
satisfiability solving	Mixed Base Rewriting for the Collatz Conjecture
Simply typed lambda calculus	deVrijer’s Measure for SN of λ→ in Scheme
static analysis	Between Derivational and Runtime Complexity
string rewriting	Mixed Base Rewriting for the Collatz Conjecture
Strong normalization	deVrijer’s Measure for SN of λ→ in Scheme
Symbolic Execution	Modular Termination Analysis of C Programs
T
term rewriting	Polynomial Termination over N is Undecidable Between Derivational and Runtime Complexity
Term Rewriting Systems	Observing Loopingness
termination	Mixed Base Rewriting for the Collatz Conjecture Formalizing Higher-Order Termination in Coq Did Turing Care of the Halting Problem?
Termination analysis	Modular Termination Analysis of C Programs Loops for which Multiphase-Linear Ranking Functions are Sufficient
Turing machines	Did Turing Care of the Halting Problem?
U
undecidability	Polynomial Termination over N is Undecidable
W
Worst-case	Efficient Computation of Polynomial Resource Bounds for Bounded-Loop Programs

Disclaimer | Powered by EasyChair Smart Program