FLOC 2022: FEDERATED LOGIC CONFERENCE 2022
WST22 PROGRAM

Days: Thursday, August 11th Friday, August 12th

Thursday, August 11th

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

09:00-10:30 Session 92J
09:00
Tuple Interpretations and Applications to Higher-Order Runtime Complexity (abstract)
09:30
A transitive HORPO for curried systems (abstract)
10:00
Approximating Relative RFC-Match-Bounds (abstract)
10:30-11:00Coffee Break
11:00-12:30 Session 95L
11:00
CeTA — Efficient Certification of Termination Proofs (abstract)
12:00
Hydra Battles and AC Termination (abstract)
PRESENTER: Aart Middeldorp
12:30-14:00Lunch Break
14:00-15:30 Session 97L
14:00
A Calculus for Modular Non-Termination Proofs by Loop Acceleration (abstract)
14:30
Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (abstract)
15:00
Improved Automatic Complexity Analysis of Integer Programs (abstract)
15:30-16:00Coffee Break
16:00-17:00 Session 98L

Business Meeting (WST 2022)

18:00-19:30Workshop Dinner (at the Technion) - Paid event
Friday, August 12th

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

10:30-11:00Coffee Break
11:00-12:30 Session 103G
11:00
LoAT: The Loop Acceleration Tool (abstract)
11:20
Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (abstract)
11:40
AProVE 2022 (abstract)
12:00
The System SOL version 2022 (Tool Description) (abstract)
12:20
Things WANDA cannot do (abstract)
12:30-14:00Lunch Break
14:00-15:30 Session 104G
14:00
CeTA – A certifier for termCOMP 2022 (abstract)
14:20
Certified Matchbox (abstract)
14:40
MultumNonMulta at termCOMP 2022 (abstract)
15:00
Runtime complexity of parallel-innermost term rewriting at TermComp 2022 (abstract)
15:20
DEPP (abstract)
PRESENTER: Aart Middeldorp
15:30-16:00Coffee Break