FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

C
Cloerkes, Daniel	AProVE 2022
D
Dollase, Stefan	AProVE 2022
F
Frohn, Florian	LoAT: The Loop Acceleration Tool AProVE 2022 A Calculus for Modular Non-Termination Proofs by Loop Acceleration Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity
Fuhs, Carsten	AProVE 2022 A Calculus for Modular Non-Termination Proofs by Loop Acceleration Runtime complexity of parallel-innermost term rewriting at TermComp 2022
G
Geser, Alfons	Approximating Relative Match-Bounds
Giesl, Jürgen	Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT LoAT: The Loop Acceleration Tool AProVE 2022 Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity Improved Automatic Complexity Analysis of Integer Programs
Guo, Liye	A transitive HORPO for curried systems
H
Hamana, Makoto	The System SOL version 2022 (Tool Description)
Hark, Marcel	Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity Improved Automatic Complexity Analysis of Integer Programs
Hensel, Jera	AProVE 2022
Hirokawa, Nao	Hydra Battles and AC Termination
Hofbauer, Dieter	Approximating Relative Match-Bounds MultumNonMulta at termCOMP 2022
I
Imai, Keigo	The System SOL version 2022 (Tool Description)
K
Keller, David	AProVE 2022
Kohl, Christina	CeTA – A certifier for termCOMP 2022
Kop, Cynthia	Tuple Interpretations and Applications to Higher-Order Runtime Complexity A transitive HORPO for curried systems Things WANDA cannot do
L
Lommen, Nils	Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT AProVE 2022 Improved Automatic Complexity Analysis of Integer Programs
M
Meyer, Eleanore	Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT AProVE 2022 Improved Automatic Complexity Analysis of Integer Programs
Middeldorp, Aart	Hydra Battles and AC Termination DEPP
Mitterwallner, Fabian	DEPP
T
Thiemann, René	CeTA — Efficient Certification of Termination Proofs CeTA – A certifier for termCOMP 2022
V
Vale, Deivid	Tuple Interpretations and Applications to Higher-Order Runtime Complexity
W
Waldmann, Johannes	Approximating Relative Match-Bounds Certified Matchbox
Y
Yamada, Akihisa	The Termination Competition

Disclaimer | Powered by EasyChair Smart Program