BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Algorithmic advances in data-flow and quantitative analysis
DTSTART:20170523T110000
DTEND:20170523T120000
DTSTAMP:20260407T105412Z
UID:8ed2e2470e44c6c51b8ec77f212be8ed2de3a47cdb7c05f414380ce9
CATEGORIES:Conferences - Seminars
DESCRIPTION:By Andreas Pavlogiannis\n\nAbstract\nStatic analysis is a stan
 dard approach for program verification and optimization. The talk will int
 roduce some new techniques for data-flow and quantitative analysis\, and i
 s structured in two parts.\n\nIn the first part\, I will present the Quant
 itative Interprocedural Analysis (QIA) framework. I will illustrate how se
 veral quantitative problems related to static analysis of recursive progra
 ms can be cast as QIA instances. I will sketch the algorithmic approach to
  performing QIA\, and present some case studies.\n\nIn the second part\, I
  will focus on exploiting the graph-theoretic notion of treewidth for prog
 ram analysis. I will present recent algorithmic advances in data-flow and 
 quantitative analysis of procedural and concurrent programs\, which exploi
 t the fact that control-flow graphs are typically graphs of small treewidt
 h. Besides improved complexity bounds\, the new approaches are suitable fo
 r on-demand analysis with strong complexity guarantees.\n\nBio\nAndreas Pa
 vlogiannis is a Ph.D. candidate at the Institute of Science and Technology
  Austria\, working on algorithmic aspects of formal verification. He obtai
 ned a Master's degree from the University of California at Davis\, and a B
 achelor's degree from the University of Patras in Greece.\n\nMore informat
 ion\n\n 
LOCATION:BC 229 https://plan.epfl.ch/?room==BC%20229
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR