XML Graphs in Program Analysis

Anders Møller, Michael Ignatieff Schwartzbach

    Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearch

    5 Citations (Scopus)

    Abstract

    XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT.
    Original languageEnglish
    Title of host publicationProceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
    EditorsGanesan Ramalingam, Eelco Visser
    Number of pages10
    PublisherAssociation for Computing Machinery
    Publication date2007
    Pages1-10
    ISBN (Print)987-1-59593-620-2
    DOIs
    Publication statusPublished - 2007
    EventWorkshop on Partial Evolution and Program Manipulation. PEPM 2007 - Nice, France
    Duration: 15 Jan 200716 Jan 2007
    Conference number: 1

    Conference

    ConferenceWorkshop on Partial Evolution and Program Manipulation. PEPM 2007
    Number1
    Country/TerritoryFrance
    CityNice
    Period15/01/200716/01/2007

    Keywords

    • XML

    Fingerprint

    Dive into the research topics of 'XML Graphs in Program Analysis'. Together they form a unique fingerprint.

    Cite this