Applying model-checking to solve queries on semistructured data

DOI10.1016/j.cl.2006.11.002zbMath1387.68104OpenAlexW1963856566MaRDI QIDQ1749228

Elisa Quintarelli, Agostino Dovier

Publication date: 16 May 2018

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.6594

zbMATH Keywords

model-checkingCTLsemistructured databases

Mathematics Subject Classification ID

Database theory (68P15) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Computation tree logic model checking based on possibility measures, Semantic consistency checking in building ontology from heterogeneous sources

Uses Software

• NuSMV
• XPath
• GraphLog
• Lorel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• CCS expressions, finite state processes, and three problems of equivalence
• A calculus of communicating systems
• Operational and abstract semantics of the query language G-Log
• An efficient algorithm for computing bisimulation equivalence
• The complexity of XPath query evaluation and XML typing
• Making prolog more expressive
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Three Partition Refinement Algorithms
• Database Theory - ICDT 2005
• Containment and equivalence for a fragment of XPath