Read more
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 Sofware Engineering at the University of Freiburg where his group has shown a remarkable ability to identify and tackle the most challenging problems in software verification.
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. The contributions in this volume demonstrate his outstanding achievements in research and education.
List of 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.
Summary
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 Sofware Engineering at the University of Freiburg where his group has shown a remarkable ability to identify and tackle the most challenging problems in software verification.
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. The contributions in this volume demonstrate his outstanding achievements in research and education.
