TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
$ | |
$k$-Rollercoaster | |
( | |
(Longest Common) Subsequences | |
A | |
Abstract interpretation | |
Algebraic groups of matrices | |
algebraic invariant | |
algebraic reasoning | |
approximation | |
Asymptotic Expansions | |
automata theory | |
automated reasoning | |
B | |
Bidding Games on Graphs | |
blockchain | |
Busy beaver | |
C | |
Collective Decision Making | |
complexity | |
constrained rewriting | |
Context-free languages | |
continous deep learning model | |
continuous dynamical systems | |
Convex Sets | |
Counter machines | |
cyclic proof | |
D | |
Decidability | |
Deterministic Sub-exponential Algorithms | |
Discounted games | |
Discounted-sum Objectives | |
discrete abstraction | |
downward closure | |
E | |
edit distance | |
Enumeration | |
Erdò‹s conjecture | |
Euclidean geometry | |
F | |
Fixpoint Algorithms | |
formal languages | |
formal methods | |
formal reasoning | |
H | |
Hypergeometric Sequences | |
I | |
Infinitary term rewriting | |
Infinite State System Reachability | |
L | |
Learning | |
Linear Constraints Loops | |
Linear Integer Arithmetic | |
Linear programming | |
Linear recurrences | |
Liveness | |
loop invariant | |
loop invariants | |
M | |
Markov decision process | |
Markov decision processes | |
matrix mortality | |
Matrix Semigroups | |
MDPs | |
Mean-payoff games | |
Membership Problem | |
Minkowski-Weyl | |
MITL model checking | |
Model checker | |
modelling dynamic systems | |
Mortality problem | |
Multi-objective | |
N | |
NFA mortality | |
nonnegative matrices | |
O | |
Omega-Regular Objectives | |
ordinary differential equation | |
P | |
Parametrized Algorithms | |
Parity | |
parity games | |
Partial exploration | |
PCTL | |
Plateaus | |
Policy iteration | |
polynomial space | |
probabilistic reasoning | |
Probabilistic verification | |
program refinement | |
program synthesis | |
program verification | |
proofs | |
Q | |
quantitative automata | |
Quantitative model checking | |
quantitative properties | |
Quantum automata | |
R | |
Rabin games | |
Rational terms | |
Reachability | |
Reachability problem | |
Reachable Simulation Problem | |
robustness | |
S | |
safety | |
satisfiability | |
Scattered Factors | |
security | |
separability | |
Sequential decision making | |
Simulation | |
Simulation algorithm | |
simultaneous unboundedness | |
Smoothed analysis | |
Statistical Model Checking | |
Stochastic games | |
Strategy iteration algorithm | |
supervision | |
Swarm Robotics | |
Symbolic Data Structure | |
T | |
term rewriting | |
Term rewriting systems | |
Threshold Problem | |
Timed automata | |
Top-down tree transducers | |
Turing machines | |
Turn-based games | |
U | |
undecidability | |
Universal Approximation theorem | |
universal trees | |
V | |
valence systems | |
Value iteration | |
vector addition system | |
Vector Addition Systems | |
verification | |
W | |
Weighted timed games | |
well-quasi-order | |
Z | |
Zariski closure | |
Zones |