IFM 2020: INTEGRATED FORMAL METHODS
TALK KEYWORD INDEX

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

A
Active Automata Learning
Active objects
Actors
B
B-Method
Boolean satisfiability
Bugs
C
Clustering
Code generation
complementation
compliance
Computational Models
Concurrency
Confluent
Continuous-State Stochastic Systems
Crash-Safety
CUDA
D
dataflow analysis
dataflow criteria
declarative process modelling
Deductive verification
Deterministic behaviour
Domain-Specific Language
DSL
Dynamic Symbolic Execution
Dynamic Taint Analysis
E
Event-B
explicit-state model checking
F
Fix-point theory
fixed-point arithmetics
Floating-point Arithmetic
Formal methods
Formal specification
formal verification
G
generic framework
GPGPU
GPU
Grey-box
H
hybrid process model
hybrid systems
I
infeasible test objectives
Interactive Verification
Interface specification
invariants
isomorphism principle
J
Java Web-application Security
K
KeY
L
law
Linear Temporal Logic
loop synthesis
M
Machine Learning
mCRL2
Model Driven Engineering
Model learning
Model-Free Policy Synthesis
models of law
multi-threaded software
N
non-linear arithmetic
numerical error analysis
numerical solvers
O
omega automata
OpenCL
P
Petri-nets
POSIX-compliant File Systems
process execution
Process mining
Process-Algebra
program optimizaton
program transformation
R
RALib
recurrence equations
Refinement
refinement and proof
reformulation
Register Automata
Reinforcement Learning
Rodin
Round-off Errors
S
Satisfiability Modulo Theories
Separation logic
Shallow Embedding
Software Verification
Sorting algorithms
SPARK
specifications
static analysis
T
Tainting
TBA1
TBA2
TBA3
test coverage
Test Stability
Theorem Proving
timed automata
timed scenarios
V
Verification
W
weak memory models
Welcome1
Welcome2
Welcome3
Well-definedness
Write-Back Caching