TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
A | |
aadl | |
Abstract domains | |
Abstract Interpretation | |
Abstraction | |
amortized cost | |
approximate bisimilar | |
Atomicity Violation | |
Automata learning | |
automotive systems | |
B | |
Barrier certificates | |
battery-aware scheduling | |
bifurcation analysis | |
Binary code | |
binary x86 analysis | |
bound analysis | |
Bounded Model Checking | |
C | |
C11 | |
Case-splitting | |
clock drifting | |
Co-simulation | |
Code generation | |
collision avoidance | |
Combinatorial testing | |
compositionality | |
Compression | |
Concurrency | |
concurrency theory | |
Concurrent Systems | |
confidence interval | |
continuous systems | |
Coq | |
correctness | |
cost analysis | |
Counter-example guided refinement | |
CSP | |
cyber-physical systems | |
D | |
Darboux polynomials | |
Data Race | |
deadlock | |
Deadlock-freedom | |
decoupling | |
Delay Differential Equations (DDEs) | |
Differential-algebraic equations | |
discounting | |
discretization | |
Distributed Algorithms | |
Distributed Real-Time Systems | |
duration calculus | |
Dynamic logic | |
dynamic programming | |
dynamical systems | |
E | |
Electrical switched networks | |
embedded systems | |
energy | |
Entailment checking | |
entropy | |
Equivalence Checking | |
Error Invariants | |
Event-B | |
F | |
Fault Explanation | |
Fault Localization | |
Finite Model Finding | |
First-Order Logic | |
Floating-point Design | |
formal methods | |
Formal model | |
Formal Model Driven Design | |
formal specification | |
Formal Specification and Verification | |
formal verification | |
Functional Mock-up Interface | |
G | |
GPU | |
H | |
hardware | |
Hardware RTL Model | |
Hazards | |
HCSP | |
High-level structure recovery | |
hybrid method | |
hybrid systems | |
Hypervisor | |
I | |
Imprecise | |
Incomplete | |
Incomplete Model Checking | |
Incremental Verification | |
Industry experience | |
Interpolation | |
Interrupt | |
invariant | |
invariants | |
ISA | |
K | |
kinetic battery model | |
Kleene algebras | |
Knowledge | |
L | |
LEON3 | |
Linear programming relaxation | |
Linearizability | |
Logic of Equality of Uninterpreted Functions | |
lower bounds | |
M | |
machine learning | |
Mathematical Induction | |
Mechanized Reasoning | |
model | |
model checking | |
model-based design | |
Model-based testing | |
Model-Checking | |
models | |
Moore machines | |
MPI | |
Multifunction Vehicle Bus controller | |
mutation testing | |
mutual information | |
N | |
Non-blocking concurrent algorithms | |
non-interference | |
O | |
on-the-fly verification of regulations | |
ordinary differential equations | |
P | |
parameterised verification | |
parametric timed automata | |
partial-order methods | |
Power/ARM | |
Predicate transformers | |
Process Algebra | |
program equivalence | |
Program Extraction | |
Program Families | |
program repair | |
program transformations | |
Program verification | |
proof | |
Proof Patterns | |
proof-rules | |
R | |
railway infrastructure designs | |
random testing | |
Reachability analysis | |
real-time control systems | |
Refactoring | |
Refinement | |
regression-verification | |
rely/guarantee concurrency | |
renewable-energy systems | |
reversible instructions | |
RPNI | |
rule-based modelling | |
S | |
Safety analysis | |
Safety Properties | |
Safety Requirement | |
SAT and SMT solvers | |
SAT formula | |
SAT solving | |
satellite | |
Satisfiability Modulo Theories | |
sdl | |
security | |
Semantically-correct static analysis | |
Separation Logic | |
Sequentialization | |
Simulink | |
Slicing | |
SMT Solvers | |
software | |
solar energy | |
SPARCv8 | |
state space exploration algorithms | |
state-space reduction | |
static analysis | |
statistical estimation | |
statistical model checking | |
Step-wise development | |
stirling engine | |
symbolic execution | |
synchronous process algebra | |
synthesis | |
system modelling | |
T | |
Tactic language | |
taste | |
temporal logic | |
testing | |
timed automata | |
timed security protocol | |
tools | |
TSO | |
U | |
Untimed Software Model | |
UPPAAL SMC | |
upper bounds | |
V | |
Validated Numerical Methods | |
Variability-Aware Static Analysis | |
VDM-SL | |
verification | |
Verification by Simulation | |
Verification of concurrent program | |
W | |
weak memory models |