Andreas Podelski
For the last ten years, Andreas Podelski has been working on
foundational and practical aspects of programming. The focus has been
on high-level languages, and the employed methods were
automata-theoretic, algebraic and logical. The results of the
research can be classified under the four headings: 1. set
constraints, 2. concurrent constraint languages, 3. record
constraints, 4. trees and automata. In his ongoing work, A.P. extends
his research areas to the verification of reactive systems. More info