Reasoning about XML with Temporal Logics and Automata

DOI10.1007/978-3-540-89439-1_7zbMath1182.68123OpenAlexW2044461288MaRDI QIDQ5505545

Cristina Sirangelo, Leonid O. Libkin

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17832666/Libkin_Sirangelo_2008_Reasoning_about_XML_with_Temporal_Logics_and_Automate.pdf

zbMATH Keywords

XMLstatic analysistemporal logicsquery automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (4)

Limiting Until in Ordered Tree Query Languages ⋮ Efficiently Deciding μ-Calculus with Converse over Finite Trees ⋮ Static analysis of XML security views and query rewriting ⋮ Reasoning about XML with temporal logics and automata

This page was built for publication: Reasoning about XML with Temporal Logics and Automata