TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
| # | |
| #SAT | |
| A | |
| Abstract Interpretation | |
| Abstraction | |
| access control | |
| access policies | |
| accountable software systems | |
| Adversarial attacks safety | |
| almost-sure termination | |
| approximate model counting | |
| Approximating Reasoning | |
| APR | |
| artificial intelligence | |
| automata theory | |
| automata-logic connection | |
| Automated Program Verification | |
| automated reasoning | |
| Automated verification | |
| Autonomous Aircraft | |
| Award CAV | |
| B | |
| Bayes error | |
| Binary decision diagram | |
| bit-blasting | |
| bit-vectors | |
| Blockchain | |
| Boolean synthesis | |
| Bucket elimination | |
| C | |
| Cardinality constraints | |
| Causality | |
| CAV | |
| CAV Award | |
| CDCL | |
| certified training | |
| CNF Encoding | |
| collective | |
| commutativity | |
| competition | |
| Compiler verification | |
| Compilers for ML | |
| Compositional Synthesis | |
| compositionality | |
| computer algebra | |
| concurrency | |
| Concurrency Shared Memory | |
| Congruence Constraint Systems | |
| Constrained Horn Clauses | |
| contract | |
| Controller Synthesis | |
| Coq | |
| correctness proof | |
| cs and law | |
| Cyber Physical System | |
| cyber-physical system | |
| D | |
| Data-driven verification | |
| Decidable Logics | |
| deductive software verification | |
| Deductive Verification | |
| Deep Learning | |
| Difference Bound Matrices | |
| Distributed Synthesis | |
| DNN-controlled Systems | |
| dynamic analysis | |
| Dynamic programming | |
| E | |
| eBPF | |
| Enumerative | |
| EVM | |
| F | |
| F* | |
| Fair division | |
| Falsification | |
| Finite Fields | |
| first-order logic | |
| first-order transition system | |
| fixpoint algorithm | |
| Formal Methods | |
| Formal modeling | |
| formal verification | |
| Framework | |
| Fuzzing | |
| G | |
| game theory | |
| Global robustness | |
| GPU | |
| graph neural networks | |
| Groebner Bases | |
| H | |
| Hardware Verification | |
| heap representation | |
| Hybrid systems verification | |
| HyperLTL | |
| Hyperparameter Tuning | |
| Hyperproperties | |
| I | |
| Incremental Solving | |
| Infinite State Systems | |
| infinite-duration games | |
| infinite-state games | |
| Information-flow | |
| Information-flow security | |
| Inner-approximations | |
| Integer polyhedra | |
| Interactive Theorem Proving | |
| Intermediate Language | |
| Interval Constraint Propagation | |
| invariant inference | |
| ivy | |
| J | |
| JIT | |
| L | |
| large language models | |
| law | |
| legacy systems | |
| legal reasoning | |
| lexicographic ranking functions | |
| linear arithmetic | |
| linear integer arithmetic | |
| Linear temporal logic | |
| Linear-time Temporal Logic | |
| Liveness Property Verification | |
| Liveness Verification | |
| Local robustness analysis | |
| location-based access control | |
| Logic | |
| LTL | |
| M | |
| Machine Learning | |
| machine learning based access control | |
| Machine Learning Models | |
| Many-valued temporal logic | |
| Martingale theory | |
| mathematical problems | |
| Mazurkiewicz traces | |
| mechanized proof | |
| message-passing | |
| MIP | |
| model based projection | |
| Model checker | |
| model checking | |
| model-based testing | |
| model-checking | |
| Monitoring | |
| monotone | |
| MPI | |
| multi-objective optimization | |
| Multi-path loops | |
| mypyvy | |
| N | |
| Neural Barrier Certificates | |
| Neural Network Verification | |
| Neural Networks | |
| NLP | |
| nonlinear arithmetic | |
| Nonlinear invariant generation | |
| Nonlinear systems | |
| O | |
| Obligations | |
| Omega-Automata | |
| Online verification | |
| opening | |
| Operator Precedence Languages | |
| optimization | |
| oracle guided synthesis | |
| P | |
| Parallel Computing | |
| Partial exploration | |
| Partial Observability | |
| Partial Order Reduction | |
| Partitioning Strategy | |
| permission-based separation logic | |
| polynomial ranking functions | |
| POMDPs | |
| portfolio | |
| prediction | |
| Presburger arithmetic | |
| Probabilistic model checking | |
| probabilistic programs | |
| probabilistic system | |
| Probabilistic verification | |
| probability theory | |
| Program repair | |
| Program Synthesis | |
| Program Verification | |
| proof assistant | |
| proof certification | |
| Proof Debugging | |
| Propositional Proofs | |
| Q | |
| quantifier alternation | |
| Quantifiers | |
| Quantum circuit simulation | |
| Quantum Computing | |
| Quantum Markov chain | |
| Quantum Markov chains | |
| Quantum Model Checking | |
| Quantum Programming Languages | |
| Quantum Walks | |
| R | |
| railway interlockings systems | |
| randomized algorithms | |
| ranking function synthesis | |
| ranking supermartingale | |
| Reachability Analysis | |
| reactive synthesis | |
| Reactive Systems | |
| Reactive verification | |
| Reconfigurable | |
| Recurrence analysis | |
| recursion | |
| regular languages | |
| regular model checking | |
| Reinforcement Learning | |
| Relational Hoare Logic | |
| relational synthesis | |
| relay-based circuits | |
| remarks | |
| robustness verification | |
| Runtime enforcement | |
| Runtime Verification | |
| S | |
| Safe Exploration | |
| Safety Verification | |
| SAT | |
| SAT solving | |
| Satisfiability | |
| Satisfiability Modulo Theories | |
| separation logic | |
| Set-boundary analysis | |
| Smart Contract Verification | |
| SMT | |
| SMT encoding | |
| SMT solver | |
| smt solving | |
| SMT-based Model Checking | |
| Software model checking | |
| software verification | |
| Solidity Smart Contracts | |
| specification | |
| Specification Language | |
| Specification Synthesis | |
| Stability | |
| Stabilizer Formalism | |
| Stateless Model Checking | |
| Static analysis | |
| Stochastic control synthesis | |
| Stochastic games | |
| strategy improvement | |
| Stream Monitoring | |
| Stutter-insensitive bisimulation | |
| Sub-polyhedral abstract domain | |
| SyGuS | |
| Symbol Model Checking | |
| symbolic abstraction | |
| Symbolic Execution | |
| Symbolic Reasoning | |
| syntax guided synthesis | |
| SYNTCOMP | |
| Synthesis | |
| System Optimization | |
| Sādhak | |
| T | |
| temporal logic | |
| termination | |
| Testing | |
| theorem proving | |
| theory of linear integer/real rings | |
| Trace | |
| Trace Analysis | |
| trace theory | |
| Transparency | |
| Tree-shaped Tableau | |
| Type system | |
| U | |
| uncertainty | |
| V | |
| value iteration | |
| Verification | |
| verification condition generation | |
| Verification Engineering | |
| virtual machines | |
| W | |
| Weakly relational abstract domains | |
| Weighted Model Counting | |
| Z | |
| Zero-Knowledge Proofs | |
| Zonotopal tiling | |
| ω | |
| ω-regular verification | |