Wed 15 Jun 2016 14:30 - 15:00 at Grand Ballroom Santa Ynez - Testing & Debugging Chair(s): Benjamin Zorn

A computation tree of a program execution describes subcomputations of functions and their call dependencies. A computation tree describes how a program works and is at the heart of algorithmic debugging. To generate a computation tree, existing algorithmic debuggers either use a complex implementation or yield a less informative approximation. We present a method for lazy functional languages that requires only a simple tracing library to generate a detailed computation tree. With our algorithmic debugger a programmer can debug any Haskell program by only importing our library and annotating suspected functions.

Wed 15 Jun

Displayed time zone: Tijuana, Baja California change

13:30 - 15:00
Testing & DebuggingResearch Papers at Grand Ballroom Santa Ynez
Chair(s): Benjamin Zorn Microsoft Research
13:30
30m
Talk
Coverage-Directed Differential Testing of JVM Implementations
Research Papers
Yuting Chen Shanghai Jiao Tong University, Ting Su East China Normal University, Chengnian Sun University of California at Davis, USA, Zhendong Su University of California, Davis, Jianjun Zhao Shanghai Jiao Tong University
Media Attached
14:00
30m
Talk
Exposing Errors Related to Weak Memory in GPU Applications
Research Papers
Tyler Sorensen University College London, Alastair F. Donaldson Imperial College London
Pre-print Media Attached
14:30
30m
Talk
Lightweight Computation Tree Tracing for Lazy Functional Languages
Research Papers
Maarten Faddegon University of Kent, UK, Olaf Chitil University of Kent, UK
Media Attached