Reasoning formally about database queries and updates

DOI10.1007/978-3-030-30942-8_33zbMATH Open1539.68091MaRDI QIDQ6535969

Rachid Echahed, Martin Strecker, Jon Haël Brenas

Publication date: 14 March 2024

zbMATH Keywords

modal logicautomated theorem provinggraph transformationsprogram verification

Mathematics Subject Classification ID

Database theory (68P15) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Frontiers of tractability for typechecking simple XML transformations
• Modal languages and bounded fragments of predicate logic
• Verifiable properties of database transactions
• Concrete Semantics
• On the Automated Verification of Web Applications with Embedded SQL
• Ensuring Correctness of Model Transformations While Remaining Decidable
• A Hoare-Like Calculus Using the SROIQ σ Logic on Transformations of Graphs
• Weakest Preconditions for High-Level Programs
• Managing Change in Graph-Structured Data Using Description Logics
• On the Restraining Power of Guards

Related Items (1)

A rule-based procedure for graph query solving

This page was built for publication: Reasoning formally about database queries and updates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535969)