26 citations · 31 across the 6 of their papers we have counts for
6 papers
Verifying Tree-Manipulating Programs via CHCs
Marco Faella, Gennaro Parlato
Programs that manipulate tree-shaped data structures often require complex, specialized proofs that are difficult to generalize and automate. This paper introduces a unified, found…
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…
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…
On the Path-Width of Integer Linear Programming
Constantin Enea, Peter Habermehl, Omar Inverso +1
We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs.…
Quantified Data Automata on Skinny Trees: an Abstract Domain for Lists
Pranav Garg, P. Madhusudan, Gennaro Parlato
We propose a new approach to heap analysis through an abstract domain of automata, called automatic shapes. The abstract domain uses a particular kind of automata, called quantifie…
Sequentializing Parameterized Programs
Salvatore La Torre, P. Madhusudan, Gennaro Parlato
We exhibit assertion-preserving (reachability preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequenti…