BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Algorithmic Advances in Automated Program Analysis
DTSTART:20190122T100000
DTEND:20190122T110000
DTSTAMP:20260408T054415Z
UID:fcf2acc807a3b39fa63a50b2d964a18f5aeb354145b93bd2e17c9e67
CATEGORIES:Conferences - Seminars
DESCRIPTION:Andreas Pavlogiannis\nAbstract\nModern-day software is increas
 ingly complex and software engineering is commonly accepted as a challengi
 ng\, error-prone task. Consequently\, software bugs are prevalent\, incurr
 ing detrimental financial costs and often risking human lives. Program ana
 lyses provide rigorous and effective means to automated bug detection\, an
 d are becoming an integral part of the software development process. In th
 is talk\, I will present recent algorithmic advances in two impactful doma
 ins of program analysis: (i) static analysis and (ii) stateless model chec
 king.\n \nStatic analyses are lightweight approximations to program behav
 ior and largely constitute the first step to bug detection in the software
  development process. In the first part\, I will introduce the Algebraic P
 ath Problem on Recursive Graphs (APP) and its close variant of Dyck Reacha
 bility (DR). These problems serve as algorithmic formulations of static an
 alyses on various domains\, such as dataflow/alias/data-dependence analysi
 s and program slicing. I will present new algorithms for APP and DR based 
 on the graph-theoretic notion of treewidth\, that lead to theoretical comp
 lexity improvements and provide a significant scalability boost in practic
 e. I will also introduce quantitative extensions to APP that can assist wi
 th code optimization at compilation time.\n \nStateless model checking is
  one of the most influential techniques in the analysis of concurrent prog
 rams because of its effectiveness in dealing with the state-explosion prob
 lem. In the second part\, I will present Dynamic Partial Order Reduction (
 DPOR)\, a widespread stateless technique for model checking of concurrent 
 programs. I will outline some foundational limitations to existing DPOR al
 gorithms\, and then present some recent efforts in overcoming these limita
 tions in a fundamental way. I will conclude with an outlook on current cha
 llenges and future directions.\n\nBio\nAndreas Pavlogiannis is a postdocto
 ral researcher in the Lab for Automated Reasoning and Analysis at Ecole Po
 lytechnique Federale de Lausanne (EPFL) in Switzerland. His research focus
 es on algorithmic aspects of programming languages and software verificati
 on. He develops algorithms -- based on rigorous foundations such as automa
 ta theory\, graph theory and combinatorial optimization -- which reason ab
 out program correctness and can also assist the compiler towards performan
 ce optimizations.\n 
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR