Certified Graph View Maintenance with Regular Datalog - Archive ouverte HAL Access content directly
Journal Articles Theory and Practice of Logic Programming Year : 2018

Certified Graph View Maintenance with Regular Datalog


We employ the Coq proof assistant to develop a mechanically-certified framework for evaluating graph queries and incrementally maintaining materialized graph instances, also called views. The language we use for defining queries and views is Regular Datalog (RD)-a notable fragment of non-recursive Datalog that can express complex navigational queries, with transitive closure as native operator. We first design and encode the theory of RD and then mechanize a RD-specific evaluation algorithm capable of fine-grained, incremental graph view computation, which we prove sound with respect to the declarative RD semantics. By using the Coq extraction mechanism , we test an OCaml version of the verified engine on a set of preliminary benchmarks. Our development is particularly focused on leveraging existing verification and notational techniques to: a) define mechanized properties that can be easily understood by logicians and database researchers and b) attain formal verification with limited effort. Our work is the first step towards a unified, machine-verified, formal framework for dynamic graph query languages and their evaluation engines.
Fichier principal
Vignette du fichier
camera-ready.pdf (750.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01932818 , version 1 (23-11-2018)



Angela Bonifati, Stefania Dumbrava, Emilio Jesús Gallego Arias. Certified Graph View Maintenance with Regular Datalog. Theory and Practice of Logic Programming, 2018, 34th International Conference on Logic Programming, 18 (3-4), pp.372-389. ⟨10.1017/S1471068418000224⟩. ⟨hal-01932818⟩
196 View
234 Download



Gmail Facebook X LinkedIn More