Write a Blog >>
Tue 20 Jun 2017 11:40 - 12:05 at Aula Master - Static Analysis and Security Chair(s): Mayur Naik

Debugging is difficult. When software fails in production, debugging is even harder, as failure reports usually provide only an incomplete picture of the failing execution. We present a system that answers control-flow queries posed by developers as formal languages, indicating whether the query expresses control flow that is possible or impossible for a given failure report. We consider three separate approaches that trade off precision, expressiveness for failure constraints, and scalability. We also introduce a new subclass of regular languages, the unreliable trace languages, which are particularly suited to answering control-flow queries in polynomial time. Our system answers queries remarkably efficiently when we encode failure constraints and user queries entirely as unreliable trace languages.

Tue 20 Jun
Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

10:50 - 12:30: PLDI Research Papers - Static Analysis and Security at Aula Master
Chair(s): Mayur NaikGeorgia Tech
pldi-2017-papers10:50 - 11:15
Timos AntonopoulosYale University, Paul GazzilloYale University, Michael HicksUniversity of Maryland, College Park, Eric KoskinenYale University, Tachio TerauchiJAIST, Shiyi WeiUniversity of Maryland, College Park
Media Attached
pldi-2017-papers11:15 - 11:40
Qinheping HuUniversity of Wisconsin-Madison, Loris D'AntoniUniversity of Wisconsin–Madison
Media Attached
pldi-2017-papers11:40 - 12:05
Peter OhmannUniversity of Wisconsin - Madison, Alexander L. BrooksUniversity of Wisconsin, Madison, Loris D'AntoniUniversity of Wisconsin–Madison, Ben LiblitUniversity of Wisconsin–Madison
Pre-print Media Attached
pldi-2017-papers12:05 - 12:30
Goran DoychevIMDEA Software Institute, Boris KöpfIMDEA Software Institute, Spain
Media Attached