FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
WST WST2018PROCEEDINGS: KEYWORD INDEX
A
Abstraction
B
Bitvectors
C
C Programming Language
Church-Turing thesis
Complexity Analysis
Complexity Proving
Computability
Control-Flow Refinment
Cost Analysis
Cost relations
D
Dependant Types
derivational complexity
G
graph rewriting
H
halting problem
Higher-Order Rewriting
higher-order term rewriting
I
Integer Transition Systems
interprocedural analysis
J
Jordan Normal Form
K
Kachinuki order
Koat
L
lambda-calculus
Logical models
M
Matrix Growth
Matrix Interpretation
O
Operational Termination
P
Partial Evaluation
path orderings
Probabilistic programs
proof checker
Q
Query Optimization
R
RankFinder
rewriting
S
specification
static dependency pairs
string rewriting
T
teaching
templates
termination
termination analysis
termination tools
V
Verification
W
Well-foundedness