FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

This page contains an index consisting of author-provided keywords.

(
(Probabilistic) Integer Programs	Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
A
Algebra Interpretations	Things WANDA cannot do
at least three keywords must be specified	Certified Matchbox
Automatic Complexity Analysis	Improved Automatic Complexity Analysis of Integer Programs Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
B
battle of Hercules and Hydra	Hydra Battles and AC Termination
C
certification	CeTA — Efficient Certification of Termination Proofs CeTA – A certifier for termCOMP 2022
Closed Form	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity
Competition	The Termination Competition
complexity	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity AProVE 2022 CeTA – A certifier for termCOMP 2022 The Termination Competition
complexity analysis	Tuple Interpretations and Applications to Higher-Order Runtime Complexity Runtime complexity of parallel-innermost term rewriting at TermComp 2022
confluence	CeTA – A certifier for termCOMP 2022
Control-Flow Refinement	Improved Automatic Complexity Analysis of Integer Programs Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
D
Decidable Subclasses	Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
decision procedure	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity
Dependency Pairs	Things WANDA cannot do
diophantine equations	DEPP
H
Higher-order rewriting	The System SOL version 2022 (Tool Description)
higher-order term rewriting	Tuple Interpretations and Applications to Higher-Order Runtime Complexity A transitive HORPO for curried systems Things WANDA cannot do
I
integer programs	Improved Automatic Complexity Analysis of Integer Programs
integer transition systems	A Calculus for Modular Non-Termination Proofs by Loop Acceleration AProVE 2022 LoAT: The Loop Acceleration Tool
Isabelle/HOL	CeTA — Efficient Certification of Termination Proofs CeTA – A certifier for termCOMP 2022
J
Java - C - Haskell - Prolog	AProVE 2022
L
linear loops	Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity
loop acceleration	A Calculus for Modular Non-Termination Proofs by Loop Acceleration LoAT: The Loop Acceleration Tool
lower bounds	LoAT: The Loop Acceleration Tool
M
Match-bounds	Approximating Relative Match-Bounds
Modular termination	The System SOL version 2022 (Tool Description)
modularity	Things WANDA cannot do
N
non-termination	A Calculus for Modular Non-Termination Proofs by Loop Acceleration LoAT: The Loop Acceleration Tool
P
parallel computation	Runtime complexity of parallel-innermost term rewriting at TermComp 2022
polynomial termination	DEPP
Probabilistic programs	AProVE 2022
Program Verification	A Calculus for Modular Non-Termination Proofs by Loop Acceleration
R
Ranking Functions	Improved Automatic Complexity Analysis of Integer Programs Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
Recursive path ordering	A transitive HORPO for curried systems
Right barren	Approximating Relative Match-Bounds
S
String rewriting	Approximating Relative Match-Bounds MultumNonMulta at termCOMP 2022 Certified Matchbox
T
Term Rewrite Systems	AProVE 2022
term rewriting	Hydra Battles and AC Termination Runtime complexity of parallel-innermost term rewriting at TermComp 2022 DEPP
TermComp	Runtime complexity of parallel-innermost term rewriting at TermComp 2022
Termination	CeTA — Efficient Certification of Termination Proofs A transitive HORPO for curried systems Approximating Relative Match-Bounds Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity Hydra Battles and AC Termination MultumNonMulta at termCOMP 2022 The System SOL version 2022 (Tool Description) AProVE 2022 Certified Matchbox CeTA – A certifier for termCOMP 2022 Things WANDA cannot do The Termination Competition
Termination Competition	MultumNonMulta at termCOMP 2022
The General Schema	The System SOL version 2022 (Tool Description)
tuple interpretations	Tuple Interpretations and Applications to Higher-Order Runtime Complexity
U
Upper and Lower Bounds	AProVE 2022

Disclaimer | Powered by EasyChair Smart Program