ESOP 2015
Tue 14 - Thu 16 April 2015 London, United Kingdom
Wed 15 Apr 2015 17:30 - 18:00 at Skeel - Session 6 Chair(s): Helmut Seidl

In this work, we propose a formal model of asynchronous event-driven programs which goes a long way in bridging the semantic gap between programs and existing models, in particular by allowing the dynamic creation of concurrent tasks, events, task buffers, and threads, and capturing precisely the interaction between these quantities. We demonstrate that the analogous program analysis problems based on our new model remain decidable, and that our new model is strictly more expressive than the existing Petri net based models. Our proof relies on a class of high-level Petri nets called Data Nets, whose tokens carry names taken from an infinite and linearly ordered domain. This result represents a significant expansion to the decidability frontier for concurrent program analyses.

Wed 15 Apr

16:30 - 18:00: ESOP - Session 6 at Skeel
Chair(s): Helmut SeidlTechnische Universität München
esop-2015-papers16:30 - 17:00
Arlen CoxUniversity of Colorado Boulder, Bor-Yuh Evan ChangUniversity of Colorado Boulder, Xavier RivalINRIA/CNRS/ENS Paris
esop-2015-papers17:00 - 17:30
Stefano CalzavaraUniversità Ca' Foscari Venezia, Michele BugliesiUniversità Ca' Foscari Venezia, Silvia CrafaUniversity of Padova, Enrico SteffinlongoUniversità Ca' Foscari Venezia
esop-2015-papers17:30 - 18:00
Michael EmmiIMDEA Software Institute, Pierre GantyIMDEA Software Institute, Rupak MajumdarMPI-SWS, Fernando Rosa-VelardoUniversidad Complutense de Madrid