FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

(
(Probabilistic) Integer Programs	Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (, talk)
A
at least three keywords must be specified	Certified Matchbox (, talk)
Automatic Complexity Analysis	Improved Automatic Complexity Analysis of Integer Programs (, talk) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (, talk)
B
battle of Hercules and Hydra	Hydra Battles and AC Termination (, talk)
C
Certification	CeTA – A certifier for termCOMP 2022 (, talk)
Closed Form	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (, talk)
Complexity	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (, talk) CeTA – A certifier for termCOMP 2022 (, talk)
complexity analysis	Tuple Interpretations and Applications to Higher-Order Runtime Complexity (, talk)
Confluence	CeTA – A certifier for termCOMP 2022 (, talk)
Control-Flow Refinement	Improved Automatic Complexity Analysis of Integer Programs (, talk) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (, talk)
D
decidable subclasses	Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (, talk)
Decision Procedure	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (, talk)
F
formalization	Efficient Formalization of Simplification Orders ()
H
higher-order term rewriting	Tuple Interpretations and Applications to Higher-Order Runtime Complexity (, talk) A transitive HORPO for curried systems (, talk)
I
Integer Programs	Improved Automatic Complexity Analysis of Integer Programs (, talk)
integer transition systems	A Calculus for Modular Non-Termination Proofs by Loop Acceleration (, talk)
Isabelle/HOL	Efficient Formalization of Simplification Orders () CeTA – A certifier for termCOMP 2022 (, talk)
L
Linear Loops	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (, talk)
loop acceleration	A Calculus for Modular Non-Termination Proofs by Loop Acceleration (, talk)
M
Match-bounds	Approximating Relative Match-Bounds (, talk)
N
non-termination	A Calculus for Modular Non-Termination Proofs by Loop Acceleration (, talk)
P
Program verification	A Calculus for Modular Non-Termination Proofs by Loop Acceleration (, talk)
R
Ranking Functions	Improved Automatic Complexity Analysis of Integer Programs (, talk) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT (, talk)
Recursive path ordering	A transitive HORPO for curried systems (, talk)
Right barren	Approximating Relative Match-Bounds (, talk)
S
simplification order	Efficient Formalization of Simplification Orders ()
String rewriting	Approximating Relative Match-Bounds (, talk) Certified Matchbox (, talk)
T
term rewriting	Hydra Battles and AC Termination (, talk)
Termination	A transitive HORPO for curried systems (, talk) Approximating Relative Match-Bounds (, talk) Hydra Battles and AC Termination (, talk) Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (, talk) CeTA – A certifier for termCOMP 2022 (, talk) Certified Matchbox (, talk)
termination analysis	Efficient Formalization of Simplification Orders ()
tuple interpretations	Tuple Interpretations and Applications to Higher-Order Runtime Complexity (, talk)

Disclaimer | Powered by EasyChair Smart Program