3 citations · 7 across the 5 of their papers we have counts for
4 papers · 1 filter
Finding Regular Herbrand Models for CHCs using Answer Set Programming
Gregoire Maire, Thomas Genet
We are interested in proving satisfiability of Constrained Horn Clauses (CHCs) over Algebraic Data Types (ADTs). We propose to prove satisfiability by building a tree automaton rec…
Reachability Analysis of Innermost Rewriting
Thomas Genet, Yann Salmon
We consider the problem of inferring a grammar describing the output of a functional program given a grammar describing its input. Solutions to this problem are helpful for detecti…
Towards Static Analysis of Functional Programs using Tree Automata Completion
Thomas Genet
This paper presents the first step of a wider research effort to apply tree automata completion to the static analysis of functional programs. Tree Automata Completion is a family…
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems
Benoît Boyer, Thomas Genet
The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and verification tec…