XML Graphs in Program Analysis

Anders Møller; Michael Ignatieff Schwartzbach

doi:10.1145/1244381.1244383

XML Graphs in Program Analysis

Anders Møller, Michael Ignatieff Schwartzbach

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research

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 language	English
Title of host publication	Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation
Editors	Ganesan Ramalingam, Eelco Visser
Number of pages	10
Publisher	Association for Computing Machinery
Publication date	2007
Pages	1-10
ISBN (Print)	987-1-59593-620-2
DOIs	https://doi.org/10.1145/1244381.1244383
Publication status	Published - 2007
Event	Workshop on Partial Evolution and Program Manipulation. PEPM 2007 - Nice, France Duration: 15 Jan 2007 → 16 Jan 2007 Conference number: 1

Conference

Conference	Workshop on Partial Evolution and Program Manipulation. PEPM 2007
Number	1
Country/Territory	France
City	Nice
Period	15/01/2007 → 16/01/2007

Keywords

XML

Access to Document

10.1145/1244381.1244383

Cite this

@inproceedings{ee85b5a035c211dcbee902004c4f4f50,

title = "XML Graphs in Program Analysis",

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.",

keywords = "XML",

author = "Anders M{\o}ller and Schwartzbach, {Michael Ignatieff}",

note = "Invited Paper; Workshop on Partial Evolution and Program Manipulation. PEPM 2007 ; Conference date: 15-01-2007 Through 16-01-2007",

year = "2007",

doi = "10.1145/1244381.1244383",

language = "English",

isbn = "987-1-59593-620-2",

pages = "1--10",

editor = "Ganesan Ramalingam and Eelco Visser",

booktitle = "Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation",

publisher = "Association for Computing Machinery",

address = "United States",

}

Møller, A & Schwartzbach, MI 2007, XML Graphs in Program Analysis. in G Ramalingam & E Visser (eds), Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation. Association for Computing Machinery, pp. 1-10, Workshop on Partial Evolution and Program Manipulation. PEPM 2007, Nice, France, 15/01/2007. https://doi.org/10.1145/1244381.1244383

TY - GEN

T1 - XML Graphs in Program Analysis

AU - Møller, Anders

AU - Schwartzbach, Michael Ignatieff

N1 - Conference code: 1

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - XML

U2 - 10.1145/1244381.1244383

DO - 10.1145/1244381.1244383

M3 - Article in proceedings

SN - 987-1-59593-620-2

SP - 1

EP - 10

BT - Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

A2 - Ramalingam, Ganesan

A2 - Visser, Eelco

PB - Association for Computing Machinery

T2 - Workshop on Partial Evolution and Program Manipulation. PEPM 2007

Y2 - 15 January 2007 through 16 January 2007

ER -

XML Graphs in Program Analysis

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this