Write a Blog >>
POPL 2021
Sun 17 - Fri 22 January 2021 Online
Tue 19 Jan 2021 17:00 - 17:30 at PADL - Declarative Approaches to Testing and Debugging Chair(s): Paul Tarau

In this paper we present the elements of an algorithmic debugger for XQuery. Given a XQuery program/query, a debugging tree is built in which the root is the query and the answer, and non-root nodes contain the results of function calls and XPath expressions computed from the query. Using the higher-order capabilities of XQuery several navigation strategies can be defined, enabling the adaptation of the debugging to the program/query and the user needs. Debugging trees and concepts as (partially) incomplete and incorrect answers are formally defined for queries in terms of XQuery semantics. A Web tool has been developed allowing the visualization of the debugging tree and the debugging of a XQuery program/query with the selected navigation strategy.

Tue 19 Jan

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

16:00 - 17:30
Declarative Approaches to Testing and DebuggingPADL at PADL
Chair(s): Paul Tarau University of North Texas
16:00
30m
Research paper
ConFuzz: Coverage-guided Property Fuzzing for Event-driven Programs
PADL
Sumit Padhiyar Indian Institue Of Technology, Madras, KC Sivaramakrishnan IIT Madras
Link to publication
16:30
30m
Research paper
Causal-Consistent Reversible Debugging: Improving CauDEr
PADL
Juan José González-Abril MiST, VRAIN, Universitat Politecnica de Valencia, German Vidal Universitat Politecnica de Valencia
17:00
30m
Research paper
Declarative Debugging of XML Queries
PADL
Jesus M. Almendros-Jimenez Universidad de Almeria, Antonio Becerra-Teron University of Almeria