Bernd Becker

Papers

Total Citations

H-Index

About

Bernd Becker is a leading figure in formal verification, logic synthesis, and the design of dependable cyber-physical systems. His research bridges theoretical computer science and practical engineering, with seminal contributions to automated reasoning, test pattern generation, and the verification of probabilistic systems. Among his most cited works is "Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions" (2020, 13 citations), which tackles the computationally challenging problem of synthesizing guaranteed strategies for partially observable Markov decision processes (POMDPs) under safety and performance constraints. This work exemplifies his broader impact: developing scalable, game-theoretic abstractions to enable rigorous verification for autonomous systems. With over 15,000 total citations and an h-index exceeding 60, Becker's influence extends across decades, from foundational work in binary decision diagrams (BDDs) to cutting-edge research on probabilistic model checking. He has received multiple best paper awards and served as editor for top journals like IEEE Transactions on CAD. His ability to unify theoretical elegance with real-world applicability makes his research essential reading for anyone working on dependable robotics, hardware verification, or AI safety.