Interprocedural information flow analysis of XML processors

Helmut Seidl; Máté Kovács

doi:10.1007/978-3-319-04921-2_4

Interprocedural information flow analysis of XML processors

Helmut Seidl, Máté Kovács

Informatics 2 - Chair of Formal Languages, Compiler Construction, Software Construction

Technical University of Munich

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

A crucial issue when providing publicly accessible web services is that sensitive data should only be accessible by authorized users. Accessibility of data within an application or information flow can conveniently be formalized as a 2-hyperproperty of a program. Here, we present a technique to interprocedurally analyze information flow in XML processors. Our approach is based on general techniques for program matching, and relational abstract interpretation of the resulting 2-programs. In case of XML processors, the abstract relational semantics then can be practically analyzed by means of finite tree automata.

Original language	English
Title of host publication	Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings
Pages	34-61
Number of pages	28
DOIs	https://doi.org/10.1007/978-3-319-04921-2_4
State	Published - 2014
Event	8th International Conference on Language and Automata Theory and Applications, LATA 2014 - Madrid, Spain Duration: 10 Mar 2014 → 14 Mar 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8370 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International Conference on Language and Automata Theory and Applications, LATA 2014
Country/Territory	Spain
City	Madrid
Period	10/03/14 → 14/03/14

Access to Document

10.1007/978-3-319-04921-2_4

Cite this

Seidl, H., & Kovács, M. (2014). Interprocedural information flow analysis of XML processors. In Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings (pp. 34-61). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8370 LNCS). https://doi.org/10.1007/978-3-319-04921-2_4

@inproceedings{b5f1fe9b1c3f40f1a65ded2f0b0bb64f,

title = "Interprocedural information flow analysis of XML processors",

abstract = "A crucial issue when providing publicly accessible web services is that sensitive data should only be accessible by authorized users. Accessibility of data within an application or information flow can conveniently be formalized as a 2-hyperproperty of a program. Here, we present a technique to interprocedurally analyze information flow in XML processors. Our approach is based on general techniques for program matching, and relational abstract interpretation of the resulting 2-programs. In case of XML processors, the abstract relational semantics then can be practically analyzed by means of finite tree automata.",

author = "Helmut Seidl and M{\'a}t{\'e} Kov{\'a}cs",

note = "Funding Information: This work was partially supported by the German Research Foundation (DFG) under the project SpAGAT (grant no. SE 551/14-2) in the priority program “Reliably Secure Software Systems – RS3”.; 8th International Conference on Language and Automata Theory and Applications, LATA 2014 ; Conference date: 10-03-2014 Through 14-03-2014",

year = "2014",

doi = "10.1007/978-3-319-04921-2_4",

language = "English",

isbn = "9783319049205",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "34--61",

booktitle = "Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings",

}

Seidl, H & Kovács, M 2014, Interprocedural information flow analysis of XML processors. in Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8370 LNCS, pp. 34-61, 8th International Conference on Language and Automata Theory and Applications, LATA 2014, Madrid, Spain, 10/03/14. https://doi.org/10.1007/978-3-319-04921-2_4

Interprocedural information flow analysis of XML processors. / Seidl, Helmut; Kovács, Máté.
Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings. 2014. p. 34-61 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8370 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Interprocedural information flow analysis of XML processors

AU - Seidl, Helmut

AU - Kovács, Máté

N1 - Funding Information: This work was partially supported by the German Research Foundation (DFG) under the project SpAGAT (grant no. SE 551/14-2) in the priority program “Reliably Secure Software Systems – RS3”.

PY - 2014

Y1 - 2014

N2 - A crucial issue when providing publicly accessible web services is that sensitive data should only be accessible by authorized users. Accessibility of data within an application or information flow can conveniently be formalized as a 2-hyperproperty of a program. Here, we present a technique to interprocedurally analyze information flow in XML processors. Our approach is based on general techniques for program matching, and relational abstract interpretation of the resulting 2-programs. In case of XML processors, the abstract relational semantics then can be practically analyzed by means of finite tree automata.

AB - A crucial issue when providing publicly accessible web services is that sensitive data should only be accessible by authorized users. Accessibility of data within an application or information flow can conveniently be formalized as a 2-hyperproperty of a program. Here, we present a technique to interprocedurally analyze information flow in XML processors. Our approach is based on general techniques for program matching, and relational abstract interpretation of the resulting 2-programs. In case of XML processors, the abstract relational semantics then can be practically analyzed by means of finite tree automata.

UR - http://www.scopus.com/inward/record.url?scp=84898061698&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-04921-2_4

DO - 10.1007/978-3-319-04921-2_4

M3 - Conference contribution

AN - SCOPUS:84898061698

SN - 9783319049205

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 34

EP - 61

BT - Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings

T2 - 8th International Conference on Language and Automata Theory and Applications, LATA 2014

Y2 - 10 March 2014 through 14 March 2014

ER -

Seidl H, Kovács M. Interprocedural information flow analysis of XML processors. In Language and Automata Theory and Applications - 8th International Conference, LATA 2014, Proceedings. 2014. p. 34-61. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-04921-2_4

Interprocedural information flow analysis of XML processors

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this