ESOP 2015
Tue 14 - Thu 16 April 2015 London, United Kingdom
Wed 15 Apr 2015 15:30 - 16:00 at Skeel - Session 5 Chair(s): Jan Vitek

We prove that all valid Herbrand equalities can be inter-procedurally inferred for programs where all assignments are taken into account whose right-hand sides depend on at most one variable. The analysis is based on procedure summaries representing the weakest pre-conditions for finitely many generic post-conditions with template variables. In order to arrive at effective representations for all occurring weakest pre-conditions, we show for almost all values possibly computed at run-time, that they can be uniquely factorized into tree patterns and a terminating ground term. Moreover, we introduce an approximate notion of subsumption which is effectively decidable and ensures that finite conjunctions of equalities may not grow infinitely. Based on these technical results, we realize an effective fixpoint iteration to infer all inter-procedurally valid Herbrand equalities for these programs.

Wed 15 Apr
Times are displayed in time zone: (GMT) Azores change

14:00 - 16:00: ESOP - Session 5 at Skeel
Chair(s): Jan VitekNortheastern University
esop-2015-papers14:00 - 14:30
Burke FetscherNorthwestern University, Koen ClaessenChalmers University of Technology, Michał PałkaChalmers University of Technology, John HughesChalmers University of Technology, Robby FindlerNorthwestern University
esop-2015-papers14:30 - 15:00
Ezgi ÇiçekMPI-SWS, Deepak GargMPI-SWS, Umut A. AcarCarnegie Mellon University
esop-2015-papers15:00 - 15:30
Jeremy G. SiekIndiana University, Michael M. VitousekIndiana University, Matteo CiminiIndiana University, Sam Tobin-HochstadtIndiana University, Ronald GarciaUniversity of British Columbia
esop-2015-papers15:30 - 16:00
Stefan Schulze FrielinghausTechnische Universität München, Michael PetterTechnische Universität München, Helmut SeidlTechnische Universität München