Reasoning about XML with Temporal Logics and Automata
DOI10.1007/978-3-540-89439-1_7zbMATH Open1182.68123OpenAlexW2044461288MaRDI QIDQ5505545FDOQ5505545
Authors: Cristina Sirangelo, Leonid 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
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cited In (7)
- A Formal Language for Specifying Complex XML Authorisations with Temporal Constraints
- Automata for XML -- a survey
- XML schema, tree logic and sheaves automata
- Limiting Until in ordered tree query languages
- Static analysis of XML security views and query rewriting
- Reasoning about XML with temporal logics and automata
- Efficiently deciding \(\mu\)-calculus with converse over finite trees
This page was built for publication: Reasoning about XML with Temporal Logics and Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505545)