Write a Blog >>
Thu 22 Nov 2018 10:25 - 10:50 at Boothzaal - 1 Chair(s): Eelco Visser

Abstract interpretation is a methodology for defining sound static analyses. Yet, creating a new static analyzer is a laborious and difficult task, because the analyzer is often implemented from scratch and proven sound a posteriori. To address this problem, we propose a novel approach to construct abstract interpreters from reusable analyses components. Each analysis component captures a separate aspect of the analyzed language (stores, environments, exceptions, etc.). Furthermore, analysis components can be proven sound a priori and their soundness proof remains valid when composing components. We developed a framework for reusable analysis components in Haskell for arrow-based abstract interpreters and realized 10 sound and reusable analysis components. We (re)used these components to define a $k$-CFA analysis for PCF and a reaching definition analysis for a While language.

Thu 22 Nov
Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

10:00 - 11:40: PLNL - 1 at Boothzaal
Chair(s): Eelco VisserDelft University of Technology
plnl-2018-papers10:00 - 10:25
Pablo InostrozaCWI, Tijs van der StormCentrum Wiskunde & Informatica / University of Groningen
plnl-2018-papers10:25 - 10:50
Sven KeidelDelft University of Technology, Netherlands, Sebastian ErdwegDelft University of Technology, Netherlands
plnl-2018-papers10:50 - 11:15
Trevor L. McDonellUtrecht University
plnl-2018-papers11:15 - 11:40
Folkert de VriesUniversity of Groningen, Jorge A. PĂ©rezUniversity of Groningen, The Netherlands