default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÉtienne Payet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Étienne Payet
:
Non-termination in Term Rewriting and Logic Programming. J. Autom. Reason. 68(1): 4 (2024)- [c22]Fred Mesnard, Thierry Marianne, Étienne Payet:
Automated Theorem Proving for Prolog Verification. LPAR Complementary Volume 2024: 137-151 - 2023
- [i15]Étienne Payet:
Binary Non-Termination in Term Rewriting and Logic Programming. CoRR abs/2307.11549 (2023) - [i14]Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred Mesnard, Étienne Payet:
The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions. CoRR abs/2308.09536 (2023) - [i13]Étienne Payet:
Non-Termination in Term Rewriting and Logic Programming. CoRR abs/2312.13949 (2023) - 2022
- [c21]Étienne Payet, David J. Pearce, Fausto Spoto:
On the Termination of Borrow Checking in Featherweight Rust. NFM 2022: 411-430 - 2020
- [j12]Fred Mesnard, Étienne Payet, Germán Vidal:
Selective Unification in (Constraint) Logic Programming. Fundam. Informaticae 177(3-4): 359-383 (2020) - [j11]Fred Mesnard, Étienne Payet, Germán Vidal:
Concolic Testing in CLP. Theory Pract. Log. Program. 20(5): 671-686 (2020) - [c20]Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal:
An SMT-Based Concolic Testing Tool for Logic Programs. FLOPS 2020: 215-219 - [i12]Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal:
An SMT-Based Concolic Testing Tool for Logic Programs. CoRR abs/2002.07115 (2020) - [i11]Fred Mesnard, Étienne Payet, Germán Vidal:
Concolic Testing in CLP. CoRR abs/2008.00421 (2020)
2010 – 2019
- 2018
- [c19]Étienne Payet, Fausto Spoto:
Checking Array Bounds by Abstract Interpretation and Symbolic Expressions. IJCAR 2018: 706-722 - [c18]Étienne Payet:
Guided Unfoldings for Finding Loops in Standard Term Rewriting. LOPSTR 2018: 22-37 - [i10]Étienne Payet:
Guided Unfoldings for Finding Loops in Standard Term Rewriting. CoRR abs/1808.05065 (2018) - 2017
- [c17]Fred Mesnard, Étienne Payet, Germán Vidal:
Selective unification in constraint logic programming. PPDP 2017: 115-126 - 2016
- [c16]Fred Mesnard, Étienne Payet, Germán Vidal:
On the Completeness of Selective Unification in Concolic Testing of Logic Programs. LOPSTR 2016: 205-221 - [c15]Frédéric Mesnard, Étienne Payet, Wim Vanhoof:
Towards a framework for algorithm recognition in binary code. PPDP 2016: 202-213 - [c14]Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet:
Termination analysis of floating-point programs using parameterizable rational approximations. SAC 2016: 1674-1679 - [c13]Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet:
On the Linear Ranking Problem for Simple Floating-Point Loops. SAS 2016: 300-316 - [i9]Fred Mesnard, Étienne Payet, Germán Vidal:
On the Completeness of Selective Unification in Concolic Testing of Logic Programs. CoRR abs/1608.03054 (2016) - 2015
- [j10]Fred Mesnard, Étienne Payet:
A second-order formulation of non-termination. Inf. Process. Lett. 115(11): 882-885 (2015) - [j9]Fred Mesnard, Étienne Payet, Germán Vidal:
Concolic testing in logic programming. Theory Pract. Log. Program. 15(4-5): 711-725 (2015) - [i8]Fred Mesnard, Étienne Payet, Germán Vidal:
Concolic Testing in Logic Programming. CoRR abs/1507.05454 (2015) - 2014
- [c12]Étienne Payet, Fausto Spoto:
An operational semantics for android activities. PEPM 2014: 121-132 - [i7]Étienne Payet, Fred Mesnard, Fausto Spoto:
Non-Termination Analysis of Java Bytecode. CoRR abs/1401.5292 (2014) - [i6]Fred Mesnard, Étienne Payet:
A Second-Order Formulation of Non-Termination. CoRR abs/1412.3271 (2014) - [i5]Étienne Payet, Frédéric Mesnard:
Non-termination of Dalvik bytecode via compilation to CLP. CoRR abs/1412.3729 (2014) - 2012
- [j8]Étienne Payet, Fausto Spoto:
Static analysis of Android programs. Inf. Softw. Technol. 54(11): 1192-1201 (2012) - 2011
- [c11]Étienne Payet, Fausto Spoto:
Static Analysis of Android Programs. CADE 2011: 439-445 - 2010
- [j7]Fausto Spoto, Étienne Payet:
Magic-sets for localised analysis of Java bytecode. High. Order Symb. Comput. 23(1): 29-86 (2010) - [j6]Fausto Spoto, Fred Mesnard, Étienne Payet:
A termination analyzer for Java bytecode based on path-length. ACM Trans. Program. Lang. Syst. 32(3): 8:1-8:70 (2010)
2000 – 2009
- 2009
- [j5]Étienne Payet, Frédéric Mesnard:
A non-termination criterion for binary constraint logic programs. Theory Pract. Log. Program. 9(2): 145-164 (2009) - [c10]Étienne Payet, Fausto Spoto:
Experiments with Non-Termination Analysis for Java Bytecode. BYTECODE@ETAPS 2009: 83-96 - 2008
- [j4]Étienne Payet:
Loop detection in term rewriting using the eliminating unfoldings. Theor. Comput. Sci. 403(2-3): 307-327 (2008) - [i4]Étienne Payet, Frédéric Mesnard:
A Non-Termination Criterion for Binary Constraint Logic Programs. CoRR abs/0807.3451 (2008) - 2007
- [c9]Étienne Payet, Fausto Spoto:
Magic-Sets Transformation for the Analysis of Java Bytecode. SAS 2007: 452-467 - 2006
- [j3]Étienne Payet, Frédéric Mesnard:
Nontermination inference of logic programs. ACM Trans. Program. Lang. Syst. 28(2): 256-289 (2006) - [c8]Étienne Payet:
Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator. LOPSTR 2006: 194-209 - 2005
- [c7]Étienne Payet, Frédéric Mesnard:
An Improved Non-Termination Criterion for Binary Constraint Logic Programs. WLPE 2005: 46-60 - [i3]Étienne Payet, Frédéric Mesnard:
An Improved Non-Termination Criterion for Binary Constraint Logic Programs. CoRR abs/cs/0508106 (2005) - 2004
- [c6]Étienne Payet, Frédéric Mesnard:
Inférence de non-terminaison pour les programmes logiques avec contraintes. JFPLC 2004 - [c5]Étienne Payet, Frédéric Mesnard:
Non-termination Inference for Constraint Logic Programs. SAS 2004: 377-392 - [i2]Étienne Payet, Frédéric Mesnard:
Non-Termination Inference of Logic Programs. CoRR cs.PL/0406041 (2004) - 2002
- [c4]Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel:
Non-Termination Inference for Optimal Termination Conditions of Logic Programs. JFPLC 2002: 87- - [c3]Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel:
Detecting Optimal Termination Conditions of Logic Programs. SAS 2002: 509-526 - [i1]Étienne Payet, Frédéric Mesnard:
A Generalization of the Lifting Lemma for Logic Programming. CoRR cs.LO/0212026 (2002) - 2001
- [c2]Frédéric Mesnard, Ulrich Neumerkel, Étienne Payet:
cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog. JFPLC 2001: 271-286 - 2000
- [b1]Étienne Payet:
Produit Synchronisé pour Quelques Classes de Graphes Infinis. University of La Réunion, Saint-Denis, France, 2000 - [j2]Étienne Payet:
Thue Specifications, Infinite Graphs and Synchronized Product. Fundam. Informaticae 44(3): 265-290 (2000)
1990 – 1999
- 1999
- [c1]Teodor Knapik, Étienne Payet:
Synchronized Product of Linear Bounded Machines. FCT 1999: 362-373 - 1998
- [j1]Teodor Knapik, Étienne Payet:
The Full Quotient and its Closure Property for Regular Languages. Inf. Process. Lett. 65(2): 57-62 (1998)
Coauthor Index
aka: Fred Mesnard
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-15 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
