"Algorithmic Advances in Program Analysis and Their Applications"
Software verification is an important step towards failproof systems, yet notoriously difficult. The talk will give a brief exposition of several new algorithmic ideas on a range of standard verification tasks. The new algorithms improve over existing approaches, and support on-demand analysis with strong complexity guarantees. Experiments on prototype implementations reveal that the theoretical
improvements are also realized in practice.
Andreas Pavlogiannis is a Ph.D. candidate in the Chatterjee group, working on formal verification and evolutionary game theory. He obtained a Master's degree from the University of California at Davis, and a Bachelor's degree from the University of Patras in Greece.