8 citations · 18 across the 14 of their papers we have counts for
15 papers
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…
The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions
Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer +2
This report contains the proceedings of the 19th International Workshop on Termination (WST 2023), which was held in Obergurgl during August 24--25 as part of Obergurgl Summer on R…
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…
Pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018)
Fred Mesnard, Peter J. Stuckey
This volume constitutes the pre-proceedings of the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018), held on 4-6th September 2018 in F…
On the Completeness of Selective Unification in Concolic Testing of Logic Programs
Fred Mesnard, Etienne Payet, German Vidal
Concolic testing is a popular dynamic validation technique that can be used for both model checking and automatic test case generation. We have recently introduced concolic testing…