XML Graphs in Program Analysis

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 -