ePrints

Streamlining Temporal Formal Verification over Columnar Databases

Lookup NU author(s): Dr Giacomo BergamiORCiD

Downloads

• Published version [.pdf]

Licence

This work is licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0).

Abstract

Recent findings demonstrate how database technology enhances the computation of formal verification tasks expressible in linear time logic for finite traces (LTL_f). Human-readable declarative languages also help the common practitioner to express temporal constraints in a straightforward and accessible language. Notwithstanding the former, this technology is in its infancy, and therefore, few optimization algorithms are known for dealing with massive amounts of information audited from real systems. We, therefore, present four novel algorithms subsuming entire LTL_f expressions while outperforming previous state-of-the-art implementations on top of KnoBAB, thus postulating the need for the corresponding, leading to the formulation of novel xtLTL_f-derived algebraic operators.

Publication metadata

Author(s): Bergami G

Publication type: Article

Publication status: Published

Journal: Information

Year: 2024

Volume: 15

Issue: 1

Online publication date: 08/01/2024

Acceptance date: 05/01/2024

Date deposited: 08/01/2024

ISSN (electronic): 2078-2489

Publisher: MDPI AG

URL: https://doi.org/10.3390/info15010034

DOI: 10.3390/info15010034

Data Access Statement: The dataset is available at https://osf.io/6y8cv/

Altmetrics

Share