Full Description
Andreas Podelski is one of the leading researchers in formal verification and software engineering, in particular automata and formal languages. After a Ph.D. from the University of Paris 7 in 1992 under the guidance of Maurice Nivat, he had research positions at DEC PRL and the Max Planck Institute for Computer Science. He was appointed to a professorship and Chair of Software Engineering at the University of Freiburg in 2006. Over the years, his teams have authored seminal papers presented at key international conferences that have significantly advanced the theory and practice of software model checking and verification at large, while also developing award-winning practical software verification techniques.
Andreas has a tireless dedication to distilling an idea to its very essence, challenging his collaborators and students to reach the highest level of academic rigor, and his group has shown a consistent ability to identify and solve the most challenging problems. The contributions in this volume reflect his outstanding achievements as a researcher and mentor.
Contents
A Methodology for Modular Termination Verification.- Liveness to Safety for Distributed Systems.- On the Power of Temporal Prophecy.- The Beauty of Predicate Automata.- Find, Use, and Conserve Tools for Formal Methods.- On the Design of Program Logics.- Reasoning About Hilbert's Choice Operator in SMT.- PVS as a Proof Obligation Generator.- Concurrent ∀∃-Hyperproperties.
