56 citations
- Centre National de la Recherche ScientifiqueFR7 papers
- InsermFR4 papers
- Université Paris CitéFR4 papers
- Laboratory of Excellence GR-ExFR3 papers
- University of NamurBE3 papers
- Appalachian State UniversityUS2 papers
- Biologie intégrée du globule rouge et de l'ErythropoïèseFR2 papers
- Comisión Nacional de Investigación y Desarrollo AeroespacialPE2 papers
- Délégation Paris 7FR2 papers
- Institut de Mécanique Céleste et de Calcul des ÉphéméridesFR2 papers
- Institut National de la Transfusion SanguineFR2 papers
- Institut national de recherche en sciences et technologies du numériqueFR2 papers
5 papers · 1 filter
Concolic Testing in Logic Programming
Fred Mesnard, Étienne Payet, Germán Vidal
Software testing is one of the most popular validation techniques in the software industry. Surprisingly, we can only find a few approaches to testing in the context of logic progr…
Non-Termination Analysis of Java Bytecode
Étienne Payet, Fred Mesnard, Fausto Spoto
We introduce a fully automated static analysis that takes a sequential Java bytecode program P as input and attempts to prove that there exists an infinite execution of P. The tech…
Eventual Linear Ranking Functions
Roberto Bagnara, Fred Mesnard
Program termination is a hot research topic in program analysis. The last few years have witnessed the development of termination analyzers for programming languages such as C and…
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
Roberto Bagnara, Fred Mesnard, Andrea Pescetti +1
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking f…
A Non-Termination Criterion for Binary Constraint Logic Programs
Etienne Payet, Fred Mesnard
On the one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analys…