Mon 26 Oct 2015 14:30 - 15:00 at Haselton 1 - Research Reports 2 Chair(s): Julian Dolby

Due to resource constraints, tracing production applications often results in incomplete data. Nevertheless, developers ideally want answers to queries about the program’s execution beyond data explicitly gathered. For example, a developer may ask whether a particular program statement executed during the run corresponding to a given failure report. In this work, we investigate the problem of determining whether each statement in a program executed, did not execute, or may have executed, given a set of (possibly-incomplete) observations. Using two distinct formalisms, we propose two solutions to this problem. The first formulation represents observations as regular languages, and computes intersections over these languages using finite-state acceptors. The second formulation encodes the problem as a set of Boolean constraints, and uses answer-set programming to solve the constraints.

Mon 26 Oct
Times are displayed in time zone: (GMT-04:00) Eastern Time (US & Canada) change

13:30 - 15:00: WODA - Research Reports 2 at Haselton 1
Chair(s): Julian DolbyIBM Research
woda201513:30 - 14:00
Irfan Ul HaqIMDEA Software Institute, Juan CaballeroIMDEA Software Institute, Michael D. ErnstUniversity of Washington
woda201514:00 - 14:30
Peter HoferChristian Doppler Laboratory on Monitoring and Evolution of Very-Large-Scale Software Systems, Johannes Kepler University Linz, David GnedtChristian Doppler Laboratory on Monitoring and Evolution ofVery-Large-Scale Software Systems, Johannes Kepler UniversityLinz, Hanspeter MössenböckJohannes Kepler University Linz
woda201514:30 - 15:00
Peter OhmannUniversity of Wisconsin - Madison, David Bingham BrownUniversity of Wisconsin - Madison, Ben LiblitUniversity of Wisconsin–Madison, Thomas RepsUniversity of Wisconsin - Madison and Grammatech Inc.