2 citations · 6 across the 12 of their papers we have counts for
14 papers
Proceedings of the 21st International Workshop on Termination
Florian Frohn, Étienne Payet
This report contains the proceedings of the 21st International Workshop on Termination (WST 2026), which was held in Lisbon on July 25. It was affiliated with the 13th Internationa…
Automated Theorem Proving for Prolog Verification
Fred Mesnard, Thierry Marianne, Étienne Payet
LPTP (Logic Program Theorem Prover) is an interactive natural-deduction-based theorem prover for pure Prolog programs with negation as failure, unification with the occurs check, a…
Binary Non-Termination in Term Rewriting and Logic Programming
Étienne Payet
We present a new syntactic criterion for the automatic detection of non-termination in an abstract setting that encompasses a simplified form of term rewriting and logic programmin…
Concolic Testing in CLP
Fred Mesnard, Etienne Payet, German Vidal
Concolic testing is a popular software verification technique based on a combination of concrete and symbolic execution. Its main focus is finding bugs and generating test cases wi…
An SMT-Based Concolic Testing Tool for Logic Programs
Sophie Fortz, Fred Mesnard, Etienne Payet +3
Concolic testing mixes symbolic and concrete execution to generate test cases covering paths effectively. Its benefits have been demonstrated for more than 15 years to test imperat…
Guided Unfoldings for Finding Loops in Standard Term Rewriting
Etienne Payet
In this paper, we reconsider the unfolding-based technique that we have introduced previously for detecting loops in standard term rewriting. We improve it by guiding the unfolding…