26 citations · 31 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.PL2024
Automated Verification of Tree-Manipulating Programs Using Constrained Horn Clauses
Marco Faella, Gennaro Parlato
Verifying programs that manipulate tree data structures often requires complex, ad-hoc proofs that are hard to generalize and automate. This paper introduces an automatic technique…
cs.LO2024
A Unified Automata-Theoretic Approach to LTLf Modulo Theories (Extended Version)
Marco Faella, Gennaro Parlato
We present a novel automata-based approach to address linear temporal logic modulo theory (LTL-MT) as a specification language for data words. LTL-MT extends LTL_f by replacing ato…