TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
| A | |
| abstract bisimilarity | |
| Abstract State Machines | |
| algorithmic complexity | |
| Algorithmic skeletons | |
| almost well relation | |
| automated theorem proving | |
| B | |
| Behavioral Equivalences | |
| boolean functions | |
| bottom-up rewriting systems | |
| C | |
| certifying supercompilation | |
| cofinite quantification | |
| Combinatorial Optimization | |
| combinators | |
| Comparative Semantics | |
| compilation | |
| computable analysis | |
| concurrency | |
| Concurrency Theory | |
| conjunctive decomposition | |
| constructor specialisation | |
| continuous constraint | |
| Curry-Howard correspondence | |
| D | |
| Data-Partitioning | |
| databases | |
| deductive verification of hybrid systems | |
| dependent types | |
| Diagramming Tools | |
| disjoint decomposition | |
| Distillation | |
| dynamic logic | |
| E | |
| environment model | |
| equality saturation | |
| event-B | |
| experimental evaluation | |
| F | |
| factoring multivariate polynomials | |
| fix point | |
| formal concept analysis | |
| Formal concepts | |
| Formal semantics | |
| formal verification | |
| functional programming | |
| G | |
| GiST | |
| GPU programming | |
| Graphical Modeling | |
| H | |
| Hennessy-Milner property | |
| Higman embedding | |
| Human Computer Interface | |
| I | |
| IEC 61499 | |
| in-memory index | |
| index set | |
| inductive provers | |
| infinite alphabet | |
| information flow | |
| information retrieval | |
| invariant generation | |
| J | |
| Java | |
| JavaScript | |
| K | |
| kernel module | |
| L | |
| labelled weighted transition system | |
| language design | |
| lazy lambda-calculus | |
| locally nameless representation | |
| logic circuit synthesis | |
| logic for hybrid systems | |
| loop approximation | |
| M | |
| Many-core systems | |
| Martin-Löf's type theory | |
| maximal fixed point | |
| message passing | |
| metric temporal logic | |
| Modal Transition Systems | |
| Model Checking | |
| Model-Based Diagrams | |
| multi-valued | |
| multiagent algorithm | |
| multidimensional indexing | |
| Multiple Ant Colony Optimization | |
| Multiple Trip Vehicle Routing Problem | |
| N | |
| natural language processing | |
| natural semantics | |
| O | |
| ontology population | |
| open maps | |
| OpenCL | |
| operating system kernel | |
| P | |
| Parallel programming | |
| Partial evaluation | |
| predicate abstraction | |
| pretty-printing | |
| probabilistic formal concepts | |
| process algebras | |
| process opacity | |
| processes | |
| Product Families | |
| program analysis | |
| Program Construction for Parallel Programs | |
| program specialization | |
| program transformation | |
| Program Understanding | |
| program verification | |
| promela | |
| proof calculus | |
| R | |
| R-Tree | |
| real-time models | |
| regular lookahead | |
| Repository Mining | |
| S | |
| satisfiability | |
| scalability | |
| security | |
| semantics | |
| sliding window protocol | |
| SMT | |
| Software Architecture | |
| software quality | |
| Software Tools | |
| Software Visualization | |
| specialisation | |
| Speedup | |
| spinja | |
| static verification | |
| supercompilation | |
| symbolic automaton | |
| symbolic execution | |
| symbolic transducer | |
| T | |
| Temporal modal logic | |
| theorem proving | |
| threads | |
| time modelling | |
| Time Petri Nets | |
| timed causal trees | |
| timed history preserving bisimulation | |
| type inference | |
| type system | |
| U | |
| unfold-fold transformation | |
| V | |
| Value-Passing | |
| Variability | |
| verification | |
| Version Control | |
| Visualization Tools | |