Skip to main content

Programming errors in traversal programs over structured data

Laemmel, Ralf, Thompson, Simon, Kaiser, Markus (2008) Programming errors in traversal programs over structured data. In: Vinju, Jurgen and Johnstone, Adrian, eds. 8th Workshop on Language Description, Tools and Applications. ENTCS . Springer (doi:10.1016/j.entcs.2009.09.045)

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.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1016/j.entcs.2009.09.045
Uncontrolled keywords: Traversal strategies, Traversal programming, Term rewriting, Stratego, Strafunski, Generic programming, Scrap Your Boilerplate, Type systems, Static program analysis.
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 29 Mar 2010 12:09 UTC
Last Modified: 28 May 2019 15:19 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/23961 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year