FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

Editor: Cynthia Kop

Authors	Title	Paper	Talk
René Thiemann and Akihisa Yamada	Efficient Formalization of Simplification Orders
Cynthia Kop and Deivid Vale	Tuple Interpretations and Applications to Higher-Order Runtime Complexity		Aug 11 09:00
Liye Guo and Cynthia Kop	A transitive HORPO for curried systems		Aug 11 09:30
Alfons Geser, Dieter Hofbauer and Johannes Waldmann	Approximating Relative Match-Bounds		Aug 11 10:00
Nao Hirokawa and Aart Middeldorp	Hydra Battles and AC Termination		Aug 11 12:00
Florian Frohn and Carsten Fuhs	A Calculus for Modular Non-Termination Proofs by Loop Acceleration		Aug 11 14:00
Marcel Hark, Florian Frohn and Jürgen Giesl	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity		Aug 11 14:30
Jürgen Giesl, Nils Lommen, Marcel Hark and Fabian Meyer	Improved Automatic Complexity Analysis of Integer Programs		Aug 11 15:00
Nils Lommen, Fabian Meyer, Marcel Hark and Jürgen Giesl	Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT		Aug 12 11:00
Christina Kohl and René Thiemann	CeTA – A certifier for termCOMP 2022		Aug 12 14:00
Johannes Waldmann	Certified Matchbox		Aug 12 14:20

Disclaimer | Powered by EasyChair Smart Program