WST22 Program papers: Author Index

WST22 PROGRAM PAPERS: AUTHOR INDEX

Papers Papers with Abstracts Preface Author Index Keyword Index

Shortcuts: F G H K L M T V W Y

F
Frohn, Florian	A Calculus for Modular Non-Termination Proofs by Loop Acceleration (, talk) Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (, talk)
Fuhs, Carsten	A Calculus for Modular Non-Termination Proofs by Loop Acceleration (, talk)
G
Geser, Alfons	Approximating Relative Match-Bounds (, talk)
Giesl, Jürgen	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (, talk) Improved Automatic Complexity Analysis of Integer Programs (, talk) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (, talk)
Guo, Liye	A transitive HORPO for curried systems (, talk)
H
Hark, Marcel	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (, talk) Improved Automatic Complexity Analysis of Integer Programs (, talk) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (, talk)
Hirokawa, Nao	Hydra Battles and AC Termination (, talk)
Hofbauer, Dieter	Approximating Relative Match-Bounds (, talk)
K
Kohl, Christina	CeTA – A certifier for termCOMP 2022 (, talk)
Kop, Cynthia	Tuple Interpretations and Applications to Higher-Order Runtime Complexity (, talk) A transitive HORPO for curried systems (, talk)
L
Lommen, Nils	Improved Automatic Complexity Analysis of Integer Programs (, talk) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (, talk)
M
Meyer, Fabian	Improved Automatic Complexity Analysis of Integer Programs (, talk) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (, talk)
Middeldorp, Aart	Hydra Battles and AC Termination (, talk)
T
Thiemann, René	Efficient Formalization of Simplification Orders () CeTA – A certifier for termCOMP 2022 (, talk)
V
Vale, Deivid	Tuple Interpretations and Applications to Higher-Order Runtime Complexity (, talk)
W
Waldmann, Johannes	Approximating Relative Match-Bounds (, talk) Certified Matchbox (, talk)
Y
Yamada, Akihisa	Efficient Formalization of Simplification Orders ()