Étienne Payet

Available identifiers

Publication	Date of Publication	Type
Non-termination in Term Rewriting and Logic Programming	2024-04-29	Paper
Guided unfoldings for finding loops in standard term rewriting	2023-11-09	Paper
An SMT-based concolic testing tool for logic programs	2021-07-06	Paper
Selective Unification in (Constraint) Logic Programming*	2021-05-20	Paper
Concolic Testing in CLP	2020-12-13	Paper
Checking array bounds by abstract interpretation and symbolic expressions	2018-10-18	Paper
On the linear ranking problem for simple floating-point loops	2018-08-27	Paper
Concolic testing in logic programming	2017-11-09	Paper
On the completeness of selective unification in concolic testing of logic programs	2017-10-13	Paper
The full quotient and its closure property for regular languages	2016-06-09	Paper
A second-order formulation of non-termination	2015-07-15	Paper
Magic-sets for localised analysis of Java bytecode	2012-01-13	Paper
A non-termination criterion for binary constraint logic programs	2009-04-15	Paper
Loop detection in term rewriting using the eliminating unfoldings	2008-09-16	Paper
Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator	2007-09-10	Paper
Static Analysis	2005-08-24	Paper
https://portal.mardi4nfdi.de/entity/Q4411982	2003-07-13	Paper
https://portal.mardi4nfdi.de/entity/Q4526683	2001-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4934344	2000-11-07	Paper

This page was built for person: Étienne Payet