FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

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

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

Disclaimer | Powered by EasyChair Smart Program