Bibliography

Major publications by the team in recent years

[1]

S. Abiteboul, L. Segoufin, V. Vianu.
Static analysis of active XML systems, in: ACM Symposium on Principles of Database Systems (PODS), 2008, p. 221-230.

[2]

M. Bojańczyk, L. Segoufin.
Tree languages defined in first-order logic with one quantifier alternation, in: International Colloquium on Automata, Languages and Programming (ICALP), 2008.

[3]

M. Bojańczyk, L. Segoufin, H. Straubing.
Piecewise testable tree languages, in: IEEE Symposium on Logic in Computer Science (LICS), 2008.

[4]

A. Bouhoula, F. Jacquemard.
Automated Induction with Constrained Tree Automata, in: Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR'08), Sydney, Australia, A. Armando, P. Baumgartner, G. Dowek (editors), Lecture Notes in Artificial Intelligence, Springer-Verlag, August 2008, vol. 5195, p. 539-553
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BJ-ijcar08.pdf.

[5]

H. Comon-Lundh, F. Jacquemard, N. Perrin.
Visibly Tree Automata with Memory and Constraints, in: Logical Methods in Computer Science, June 2008, vol. 4, n^o 2:8
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CJP-lmcs08.pdf.

[6]

S. Demri, R. Lazić.
LTL with the freeze quantifier and register automata, in: ACM Transactions on Computational Logic, 2008
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DL-tocl08.pdf, To appear.

[7]

S. Demri, R. Lazić, A. Sangnier.
Model checking freeze LTL over one-counter automata, in: Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), Budapest, Hungary, R. Amadio (editor), Lecture Notes in Computer Science, Springer, March-April 2008, vol. 4962, p. 490-504
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DLS-fossacs08.pdf.

[8]

F. Jacquemard, M. Rusinowitch.
Closure of Hedge-Automata Languages by Hedge Rewriting, in: Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA'08), Hagenberg, Austria, A. Voronkov (editor), Lecture Notes in Computer Science, Springer, July 2008, vol. 5117, p. 157-171
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JR-rta08.pdf.

[9]

F. Jacquemard, M. Rusinowitch, L. Vigneron.
Tree automata with equality constraints modulo equational theories, in: Journal of Logic and Algebraic Programming, April 2008, vol. 75, n^o 2, p. 182-208
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JRV-jlap08.pdf.

[10]

B. ten Cate, L. Segoufin.
XPath, transitive closure logic, and nested tree walking automata, in: ACM Symposium on Principles of Database Systems (PODS), 2008, p. 251-260.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]

C. David.
Analyse de XML avec données non-bornées, University of Paris VII, 2009, Ph. D. Thesis.

Articles in International Peer-Reviewed Journal

[12]

S. Abiteboul, L. Segoufin, V. Vianu.
Modeling and Verifying Active XML Artifacts, in: IEEE Data Eng. Bull., 2009, vol. 32, n^o 3, p. 10-15.

[13]

S. Abiteboul, L. Segoufin, V. Vianu.
Static Analysis of Active XML Services, in: ACM trans. on Database Systems (TODS), 2009, vol. 34, n^o 4.

[14]

S. Abiteboul, B. Cautis, T. Milo.
Reasoning about XML Update Constraints, in: Journal of Computer and System Sciences (JCSS), 2009.

[15]

S. Abiteboul, B. Kimelfeld, Y. Sagiv, P. Senellart.
On the Expressiveness of Probabilistic XML Models, in: VLDB Journal, October 2009, vol. 18, n^o 5, p. 1041-1064.

[16]

M. Bojańczyk, A. Muscholl, T. Schwentick, L. Segoufin.
Two-variable logic on data trees and XML reasoning, in: Journal of ACM, 2009, vol. 56, n^o 3.

[17]

S. Demri, R. Gascon.
The effects of bounding syntactic resources on Presburger LTL, in: Journal of Logic and Computation, 2009, to appear.

[18]

B. ten Cate, C. Lutz.
The complexity of query containment in expressive fragments of XPath 2.0, in: J. ACM, 2009, vol. 56, n^o 6.

Invited Conferences

[19]

S. Abiteboul, P. Bourhis, A. Galland, B. Marinoiu.
The AXML Artifact Model, in: Intern. Conf. on Temporal Representation and Reasoning (TIME), 2009.

International Peer-Reviewed Conference/Proceedings

[20]

S. Abiteboul, T-H. Hubert. Chan, E. Kharlamov, W. Nutt, P. Senellart.
Agrégation de documents XML probabilistes, in: Proc. of Intl. Conf. on Database Theory (ICDT), 2010.

[21]

S. Abiteboul, G. Gottlob, M. Manna.
Distributed XML design, in: Proc. ACM Symp. on Principles of Database Systems (PODS), 2009, p. 247-258.

[22]

L. Afanasiev, B. ten Cate.
On Core XPath with inflationary fixed points, in: Proceedings of FICS 2009, 2009, p. 11-17.

[23]

P. Barcelo, L. Libkin, A. Poggi, C. Sirangelo.
XML with incomplete information: models, properties, and query answering, in: Proc. ACM Symp. on Principles of Database Systems (PODS), 2009, p. 237-246.

[24]

N. Ben Youssef, A. Bouhoula, F. Jacquemard.
Automatic Verification of Conformance of Firewall Configurations to Security Policies, in: Proceedings of the IEEE Symposium on Computers and Communications (ISCC), IEEE, 2009.

[25]

S. Demri, M. Jurdziński, O. Lachish, R. Lazić.
The covering and boundedness problems for branching vector addition systems, in: FST&TCS'09, Kanpur, LZI, 2009.

[26]

D. Figueira.
Satisfiability of downward XPath with data equality tests, in: Proc. ACM Symp. on Principles of Database Systems (PODS), 2009, p. 197-206.

[27]

D. Figueira, L. Segoufin.
Future-Looking Logics on Data Words and Trees, in: Mathematical Foundations of Computer Science (MFCS), 2009, p. 331-343.

[28]

A. Gascón, G. Godoy, F. Jacquemard.
Closure of Tree Automata Languages under Innermost Rewriting, in: Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS'08), Castle of Hagenberg, Austria, A. Middeldorp (editor), Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, April 2009, vol. 237, p. 23-38
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GGJ-wrs08.pdf.

[29]

G. Godoy, F. Jacquemard.
Unique Normalization for Shallow TRS, in: Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA'09), Brasília, Brazil, R. Treinen (editor), Lecture Notes in Computer Science, Springer, June-July 2009, vol. 5595, p. 63-77.

[30]

F. Jacquemard, F. Klay, C. Vacher.
Rigid Tree Automata, in: Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA'09), Tarragona, Spain, A. Horia Dediu, A. Mihai Ionescu, C. Martín-Vide (editors), Lecture Notes in Computer Science, Springer, April 2009, vol. 5457, p. 446-457.

[31]

L. Libkin, C. Sirangelo.
Open and Closed World Assumptions in Data Exchange, in: Description Logics, 2009.

[32]

T. Place, L. Segoufin.
A Decidable Characterization of Locally Testable Tree Languages, in: Proc. of Intl. Coll. on Automata, Languages and Programming (ICALP), 2009, p. 285-296.

[33]

B. ten Cate, L. Chiticariu, P. G. Kolaitis, W. C. Tan.
Laconic Schema Mappings: Computing the Core with SQL Queries, in: Proceedings of the VLDB endowment, 2009, vol. 2, n^o 1, p. 1006-1017, Proceedings of the VLDB 2009 conference.

Scientific Books (or Scientific Book chapters)

[34]

S. Demri, P. Gastin.
Specification and Verification using Temporal Logics, in: Modern applications of automata theory, IIsc Research Monographs, World Scientific, 2009, vol. 2.