FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

A
Abstraction	Well-founded models in proofs of termination (PDF, talk)
B
Bitvectors	Complexity Analysis for Bitvector Programs (PDF, talk)
C
C Programming Language	Complexity Analysis for Bitvector Programs (PDF, talk)
Church-Turing thesis	Objective and Subjective Specifications (PDF, talk)
Complexity Analysis	Complexity Analysis for Bitvector Programs (PDF, talk)
Complexity Proving	A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (PDF, talk)
Computability	Improving Static Dependency Pairs for Higher-Order Rewriting (PDF, talk)
Control-Flow Refinment	Control-Flow Refinement via Partial Evaluation (PDF, talk)
Cost Analysis	Control-Flow Refinement via Partial Evaluation (PDF, talk) Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations (PDF, talk)
Cost relations	Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations (PDF, talk)
D
Dependant Types	Termination of Lambda-Pi modulo rewriting using the size-change principle (PDF, talk)
derivational complexity	Embracing Infinity - Termination of String Rewriting by Almost Linear Weight Functions (PDF, talk)
G
graph rewriting	GPO: A Path Ordering for Graphs (PDF, talk)
H
halting problem	Objective and Subjective Specifications (PDF, talk)
Higher-Order Rewriting	Termination of Lambda-Pi modulo rewriting using the size-change principle (PDF, talk)
higher-order term rewriting	Improving Static Dependency Pairs for Higher-Order Rewriting (PDF, talk)
I
Integer Transition Systems	Complexity Analysis for Bitvector Programs (PDF, talk)
interprocedural analysis	Procedure-Modular Termination Analysis (PDF, talk)
J
Jordan Normal Form	A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (PDF, talk)
K
Kachinuki order	Semantic Kachinuki Order (PDF, talk)
Koat	Control-Flow Refinement via Partial Evaluation (PDF, talk)
L
lambda-calculus	Termination of Lambda-Pi modulo rewriting using the size-change principle (PDF, talk)
Logical models	Well-founded models in proofs of termination (PDF, talk)
M
Matrix Growth	A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (PDF, talk)
Matrix Interpretation	A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving (PDF, talk)
O
Operational Termination	Well-founded models in proofs of termination (PDF, talk)
P
Partial Evaluation	Control-Flow Refinement via Partial Evaluation (PDF, talk)
path orderings	GPO: A Path Ordering for Graphs (PDF, talk)
Probabilistic programs	Inference of Linear Upper-Bounds on the Expected Cost by Solving Cost Relations (PDF, talk)
proof checker	TTT2 with Termination Templates for Teaching (PDF, talk)
Q
Query Optimization	Verification of Rewriting-based Query Optimizers (PDF, talk)
R
RankFinder	Control-Flow Refinement via Partial Evaluation (PDF, talk)
rewriting	Verification of Rewriting-based Query Optimizers (PDF, talk)
S
specification	Objective and Subjective Specifications (PDF, talk)
static dependency pairs	Improving Static Dependency Pairs for Higher-Order Rewriting (PDF, talk)
string rewriting	Semantic Kachinuki Order (PDF, talk) Embracing Infinity - Termination of String Rewriting by Almost Linear Weight Functions (PDF, talk)
T
teaching	TTT2 with Termination Templates for Teaching (PDF, talk)
templates	TTT2 with Termination Templates for Teaching (PDF, talk)
termination	Termination of Lambda-Pi modulo rewriting using the size-change principle (PDF, talk) Semantic Kachinuki Order (PDF, talk) GPO: A Path Ordering for Graphs (PDF, talk) Procedure-Modular Termination Analysis (PDF, talk) Embracing Infinity - Termination of String Rewriting by Almost Linear Weight Functions (PDF, talk)
termination analysis	Control-Flow Refinement via Partial Evaluation (PDF, talk) Improving Static Dependency Pairs for Higher-Order Rewriting (PDF, talk)
termination tools	TTT2 with Termination Templates for Teaching (PDF, talk)
V
Verification	Procedure-Modular Termination Analysis (PDF, talk) Verification of Rewriting-based Query Optimizers (PDF, talk)
W
Well-foundedness	Well-founded models in proofs of termination (PDF, talk)

Disclaimer | Powered by EasyChair Smart Program