School of Computing

Programming errors in traversal programs over structured data

Ralf Laemmel, Simon Thompson, and Markus Kaiser

In Jurgen Vinju and Adrian Johnstone, editors, 8th Workshop on Language Description, Tools and Applications, volume 238 of ENTCS, pages 182-196. Springer, April 2008 [doi].

Abstract

Traversal strategies provide an established means of describing automated queries, analyses, transformations, and other non-trivial computations on deeply structured data (including, most notably, data representations of software artifacts such as programs). The resulting traversal programs are prone to programming errors. We are specifically concerned with errors that go beyond classic type errors, in particular: (i) divergence of traversal, (ii) unintentional extent of traversal into data, (iii) trivial traversal results, (iv) inapplicability of the constituents of a traversal program along traversal. We deliver a taxonomy of programming errors, and start attacking some of them by refinements of traversal programming.

Download publication 216 kbytes (PDF)

Bibtex Record

@inproceedings{2647,
author = {Ralf Laemmel and Simon Thompson and Markus Kaiser},
title = {Programming errors in traversal programs over structured data},
month = {April},
year = {2008},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {10.1016/j.entcs.2009.09.045},
url = {http://www.cs.kent.ac.uk/pubs/2008/2647},
    publication_type = {inproceedings},
    submission_id = {11582_1203975613},
    booktitle = {8th Workshop on Language Description, Tools and Applications},
    editor = {Jurgen Vinju and Adrian Johnstone},
    series = {ENTCS},
    publisher = {Springer},
    refereed = {Yes},
    volume = {238},
    number = {5},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014