TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
A | |
abstract interpretation | |
Algebraic specification | |
Android | |
automation | |
B | |
biaffine PROP | |
C | |
CafeOBJ | |
concurrency | |
Constraint Logic Programming | |
Constraint-based synthesis | |
Constraints | |
Criterion~H | |
D | |
Dalvik | |
deadlock | |
dependency pair framework | |
Derivational complexity | |
E | |
elementary interpretations | |
F | |
Fair CTL | |
Fair Termination | |
fairness | |
G | |
GPUs | |
I | |
Infinite execution | |
J | |
Just-in-time Compilation | |
K | |
Kachinuki ordering | |
Knuth-Bendix completion | |
L | |
Linear lasso program | |
livelock | |
Liveness | |
loop | |
Loop Analysis | |
M | |
maximal completion | |
model checking | |
mutual exclusion protocol | |
N | |
network rewriting | |
non-termination | |
Nontermination | |
O | |
Orderings | |
Ordinals | |
P | |
procedural program | |
program analysis | |
program transformation | |
PROP | |
PROP quasi-order | |
R | |
Ranking Function | |
Recursive path ordering | |
regular languages | |
Runtime Complexity Analysis | |
S | |
SAT | |
SAT encoding | |
semantic labelling | |
semi-Thue system | |
shared-memory | |
string rewriting | |
T | |
temporal logic | |
Term Rewrite Systems | |
term rewriting | |
termination | |
tree automata | |
Trip Count Prediction | |
Type Introduction | |
U | |
uniform termination | |
V | |
verification |