default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Étienne Payet
@article{DBLP:journals/jar/Payet24,
author = {{\'{E}}tienne Payet},
title = {Non-termination in Term Rewriting and Logic Programming},
journal = {J. Autom. Reason.},
volume = {68},
number = {1},
pages = {4},
year = {2024},
url = {https://doi.org/10.1007/s10817-023-09693-z},
doi = {10.1007/S10817-023-09693-Z},
timestamp = {Thu, 29 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jar/Payet24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/MesnardMP24,
author = {Fred Mesnard and
Thierry Marianne and
{\'{E}}tienne Payet},
editor = {Nikolaj S. Bj{\o}rner and
Marijn Heule and
Andrei Voronkov},
title = {Automated Theorem Proving for Prolog Verification},
booktitle = {{LPAR} 2024 Complementary Volume, Port Louis, Mauritius, May 26-31,
2024},
series = {Kalpa Publications in Computing},
volume = {18},
pages = {137--151},
publisher = {EasyChair},
year = {2024},
url = {https://doi.org/10.29007/c25r},
doi = {10.29007/C25R},
timestamp = {Fri, 12 Jul 2024 15:29:30 +0200},
biburl = {https://dblp.org/rec/conf/lpar/MesnardMP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-11549,
author = {{\'{E}}tienne Payet},
title = {Binary Non-Termination in Term Rewriting and Logic Programming},
journal = {CoRR},
volume = {abs/2307.11549},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.11549},
doi = {10.48550/ARXIV.2307.11549},
eprinttype = {arXiv},
eprint = {2307.11549},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-11549.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-09536,
author = {Akihisa Yamada and
Benjamin Lucien Kaminski and
Dieter Hofbauer and
Fred Mesnard and
{\'{E}}tienne Payet},
title = {The 19th International Workshop on Termination {(WST} 2023): Preface,
Invited Talk Abstract, and Tool Descriptions},
journal = {CoRR},
volume = {abs/2308.09536},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.09536},
doi = {10.48550/ARXIV.2308.09536},
eprinttype = {arXiv},
eprint = {2308.09536},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-09536.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-13949,
author = {{\'{E}}tienne Payet},
title = {Non-Termination in Term Rewriting and Logic Programming},
journal = {CoRR},
volume = {abs/2312.13949},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.13949},
doi = {10.48550/ARXIV.2312.13949},
eprinttype = {arXiv},
eprint = {2312.13949},
timestamp = {Wed, 17 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-13949.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nfm/PayetPS22,
author = {{\'{E}}tienne Payet and
David J. Pearce and
Fausto Spoto},
editor = {Jyotirmoy V. Deshmukh and
Klaus Havelund and
Ivan Perez},
title = {On the Termination of Borrow Checking in Featherweight Rust},
booktitle = {{NASA} Formal Methods - 14th International Symposium, {NFM} 2022,
Pasadena, CA, USA, May 24-27, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13260},
pages = {411--430},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06773-0\_22},
doi = {10.1007/978-3-031-06773-0\_22},
timestamp = {Thu, 02 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nfm/PayetPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/MesnardPV20,
author = {Fred Mesnard and
{\'{E}}tienne Payet and
Germ{\'{a}}n Vidal},
title = {Selective Unification in (Constraint) Logic Programming},
journal = {Fundam. Informaticae},
volume = {177},
number = {3-4},
pages = {359--383},
year = {2020},
url = {https://doi.org/10.3233/FI-2020-1993},
doi = {10.3233/FI-2020-1993},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/MesnardPV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tplp/MesnardPV20,
author = {Fred Mesnard and
{\'{E}}tienne Payet and
Germ{\'{a}}n Vidal},
title = {Concolic Testing in {CLP}},
journal = {Theory Pract. Log. Program.},
volume = {20},
number = {5},
pages = {671--686},
year = {2020},
url = {https://doi.org/10.1017/S1471068420000216},
doi = {10.1017/S1471068420000216},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tplp/MesnardPV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/flops/FortzMPPVV20,
author = {Sophie Fortz and
Fred Mesnard and
{\'{E}}tienne Payet and
Gilles Perrouin and
Wim Vanhoof and
Germ{\'{a}}n Vidal},
editor = {Keisuke Nakano and
Konstantinos Sagonas},
title = {An SMT-Based Concolic Testing Tool for Logic Programs},
booktitle = {Functional and Logic Programming - 15th International Symposium, {FLOPS}
2020, Akita, Japan, September 14-16, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12073},
pages = {215--219},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-59025-3\_13},
doi = {10.1007/978-3-030-59025-3\_13},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/flops/FortzMPPVV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07115,
author = {Sophie Fortz and
Fred Mesnard and
{\'{E}}tienne Payet and
Gilles Perrouin and
Wim Vanhoof and
Germ{\'{a}}n Vidal},
title = {An SMT-Based Concolic Testing Tool for Logic Programs},
journal = {CoRR},
volume = {abs/2002.07115},
year = {2020},
url = {https://arxiv.org/abs/2002.07115},
eprinttype = {arXiv},
eprint = {2002.07115},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-07115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-00421,
author = {Fred Mesnard and
{\'{E}}tienne Payet and
Germ{\'{a}}n Vidal},
title = {Concolic Testing in {CLP}},
journal = {CoRR},
volume = {abs/2008.00421},
year = {2020},
url = {https://arxiv.org/abs/2008.00421},
eprinttype = {arXiv},
eprint = {2008.00421},
timestamp = {Fri, 07 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-00421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/PayetS18,
author = {{\'{E}}tienne Payet and
Fausto Spoto},
editor = {Didier Galmiche and
Stephan Schulz and
Roberto Sebastiani},
title = {Checking Array Bounds by Abstract Interpretation and Symbolic Expressions},
booktitle = {Automated Reasoning - 9th International Joint Conference, {IJCAR}
2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford,
UK, July 14-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10900},
pages = {706--722},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94205-6\_46},
doi = {10.1007/978-3-319-94205-6\_46},
timestamp = {Mon, 28 Aug 2023 21:17:45 +0200},
biburl = {https://dblp.org/rec/conf/cade/PayetS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lopstr/Payet18,
author = {{\'{E}}tienne Payet},
editor = {Fred Mesnard and
Peter J. Stuckey},
title = {Guided Unfoldings for Finding Loops in Standard Term Rewriting},
booktitle = {Logic-Based Program Synthesis and Transformation - 28th International
Symposium, {LOPSTR} 2018, Frankfurt/Main, Germany, September 4-6,
2018, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {11408},
pages = {22--37},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-13838-7\_2},
doi = {10.1007/978-3-030-13838-7\_2},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/lopstr/Payet18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-05065,
author = {{\'{E}}tienne Payet},
title = {Guided Unfoldings for Finding Loops in Standard Term Rewriting},
journal = {CoRR},
volume = {abs/1808.05065},
year = {2018},
url = {http://arxiv.org/abs/1808.05065},
eprinttype = {arXiv},
eprint = {1808.05065},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-05065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppdp/MesnardPV17,
author = {Fred Mesnard and
{\'{E}}tienne Payet and
Germ{\'{a}}n Vidal},
editor = {Wim Vanhoof and
Brigitte Pientka},
title = {Selective unification in constraint logic programming},
booktitle = {Proceedings of the 19th International Symposium on Principles and
Practice of Declarative Programming, Namur, Belgium, October 09 -
11, 2017},
pages = {115--126},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3131851.3131863},
doi = {10.1145/3131851.3131863},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ppdp/MesnardPV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lopstr/MesnardPV16,
author = {Fred Mesnard and
{\'{E}}tienne Payet and
Germ{\'{a}}n Vidal},
editor = {Manuel V. Hermenegildo and
Pedro L{\'{o}}pez{-}Garc{\'{\i}}a},
title = {On the Completeness of Selective Unification in Concolic Testing of
Logic Programs},
booktitle = {Logic-Based Program Synthesis and Transformation - 26th International
Symposium, {LOPSTR} 2016, Edinburgh, UK, September 6-8, 2016, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10184},
pages = {205--221},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-63139-4\_12},
doi = {10.1007/978-3-319-63139-4\_12},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lopstr/MesnardPV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppdp/MesnardPV16,
author = {Fr{\'{e}}d{\'{e}}ric Mesnard and
{\'{E}}tienne Payet and
Wim Vanhoof},
editor = {James Cheney and
Germ{\'{a}}n Vidal},
title = {Towards a framework for algorithm recognition in binary code},
booktitle = {Proceedings of the 18th International Symposium on Principles and
Practice of Declarative Programming, Edinburgh, United Kingdom, September
5-7, 2016},
pages = {202--213},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2967973.2968600},
doi = {10.1145/2967973.2968600},
timestamp = {Tue, 06 Nov 2018 16:57:25 +0100},
biburl = {https://dblp.org/rec/conf/ppdp/MesnardPV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sac/MauricaMP16,
author = {Fonenantsoa Maurica and
Fr{\'{e}}d{\'{e}}ric Mesnard and
{\'{E}}tienne Payet},
editor = {Sascha Ossowski},
title = {Termination analysis of floating-point programs using parameterizable
rational approximations},
booktitle = {Proceedings of the 31st Annual {ACM} Symposium on Applied Computing,
Pisa, Italy, April 4-8, 2016},
pages = {1674--1679},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2851613.2851834},
doi = {10.1145/2851613.2851834},
timestamp = {Tue, 06 Nov 2018 11:06:49 +0100},
biburl = {https://dblp.org/rec/conf/sac/MauricaMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sas/MauricaMP16,
author = {Fonenantsoa Maurica and
Fr{\'{e}}d{\'{e}}ric Mesnard and
{\'{E}}tienne Payet},
editor = {Xavier Rival},
title = {On the Linear Ranking Problem for Simple Floating-Point Loops},
booktitle = {Static Analysis - 23rd International Symposium, {SAS} 2016, Edinburgh,
UK, September 8-10, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9837},
pages = {300--316},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53413-7\_15},
doi = {10.1007/978-3-662-53413-7\_15},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/sas/MauricaMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MesnardPV16,
author = {Fred Mesnard and
{\'{E}}tienne Payet and
Germ{\'{a}}n Vidal},
title = {On the Completeness of Selective Unification in Concolic Testing of
Logic Programs},
journal = {CoRR},
volume = {abs/1608.03054},
year = {2016},
url = {http://arxiv.org/abs/1608.03054},
eprinttype = {arXiv},
eprint = {1608.03054},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MesnardPV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MesnardP15,
author = {Fred Mesnard and
{\'{E}}tienne Payet},
title = {A second-order formulation of non-termination},
journal = {Inf. Process. Lett.},
volume = {115},
number = {11},
pages = {882--885},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.05.012},
doi = {10.1016/J.IPL.2015.05.012},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MesnardP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tplp/MesnardPV15,
author = {Fred Mesnard and
{\'{E}}tienne Payet and
Germ{\'{a}}n Vidal},
title = {Concolic testing in logic programming},
journal = {Theory Pract. Log. Program.},
volume = {15},
number = {4-5},
pages = {711--725},
year = {2015},
url = {https://doi.org/10.1017/S1471068415000332},
doi = {10.1017/S1471068415000332},
timestamp = {Thu, 13 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tplp/MesnardPV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MesnardPV15,
author = {Fred Mesnard and
{\'{E}}tienne Payet and
Germ{\'{a}}n Vidal},
title = {Concolic Testing in Logic Programming},
journal = {CoRR},
volume = {abs/1507.05454},
year = {2015},
url = {http://arxiv.org/abs/1507.05454},
eprinttype = {arXiv},
eprint = {1507.05454},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MesnardPV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pepm/PayetS14,
author = {{\'{E}}tienne Payet and
Fausto Spoto},
editor = {Wei{-}Ngan Chin and
Jurriaan Hage},
title = {An operational semantics for android activities},
booktitle = {Proceedings of the {ACM} {SIGPLAN} 2014 workshop on Partial evaluation
and program manipulation, {PEPM} 2014, January 20-21, 2014, San Diego,
California, {USA}},
pages = {121--132},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2543728.2543748},
doi = {10.1145/2543728.2543748},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pepm/PayetS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PayetMS14,
author = {{\'{E}}tienne Payet and
Fred Mesnard and
Fausto Spoto},
title = {Non-Termination Analysis of Java Bytecode},
journal = {CoRR},
volume = {abs/1401.5292},
year = {2014},
url = {http://arxiv.org/abs/1401.5292},
eprinttype = {arXiv},
eprint = {1401.5292},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PayetMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MesnardP14,
author = {Fred Mesnard and
{\'{E}}tienne Payet},
title = {A Second-Order Formulation of Non-Termination},
journal = {CoRR},
volume = {abs/1412.3271},
year = {2014},
url = {http://arxiv.org/abs/1412.3271},
eprinttype = {arXiv},
eprint = {1412.3271},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MesnardP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PayetM14,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
title = {Non-termination of Dalvik bytecode via compilation to {CLP}},
journal = {CoRR},
volume = {abs/1412.3729},
year = {2014},
url = {http://arxiv.org/abs/1412.3729},
eprinttype = {arXiv},
eprint = {1412.3729},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PayetM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/infsof/PayetS12,
author = {{\'{E}}tienne Payet and
Fausto Spoto},
title = {Static analysis of Android programs},
journal = {Inf. Softw. Technol.},
volume = {54},
number = {11},
pages = {1192--1201},
year = {2012},
url = {https://doi.org/10.1016/j.infsof.2012.05.003},
doi = {10.1016/J.INFSOF.2012.05.003},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/infsof/PayetS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/PayetS11,
author = {{\'{E}}tienne Payet and
Fausto Spoto},
editor = {Nikolaj S. Bj{\o}rner and
Viorica Sofronie{-}Stokkermans},
title = {Static Analysis of Android Programs},
booktitle = {Automated Deduction - {CADE-23} - 23rd International Conference on
Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6803},
pages = {439--445},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22438-6\_33},
doi = {10.1007/978-3-642-22438-6\_33},
timestamp = {Mon, 28 Aug 2023 21:17:45 +0200},
biburl = {https://dblp.org/rec/conf/cade/PayetS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/SpotoP10,
author = {Fausto Spoto and
{\'{E}}tienne Payet},
title = {Magic-sets for localised analysis of Java bytecode},
journal = {High. Order Symb. Comput.},
volume = {23},
number = {1},
pages = {29--86},
year = {2010},
url = {https://doi.org/10.1007/s10990-010-9063-7},
doi = {10.1007/S10990-010-9063-7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lisp/SpotoP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toplas/SpotoMP10,
author = {Fausto Spoto and
Fred Mesnard and
{\'{E}}tienne Payet},
title = {A termination analyzer for Java bytecode based on path-length},
journal = {{ACM} Trans. Program. Lang. Syst.},
volume = {32},
number = {3},
pages = {8:1--8:70},
year = {2010},
url = {https://doi.org/10.1145/1709093.1709095},
doi = {10.1145/1709093.1709095},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toplas/SpotoMP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tplp/PayetM09,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
title = {A non-termination criterion for binary constraint logic programs},
journal = {Theory Pract. Log. Program.},
volume = {9},
number = {2},
pages = {145--164},
year = {2009},
url = {https://doi.org/10.1017/S1471068409003652},
doi = {10.1017/S1471068409003652},
timestamp = {Thu, 13 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tplp/PayetM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/PayetS09,
author = {{\'{E}}tienne Payet and
Fausto Spoto},
editor = {Elvira Albert and
Samir Genaim},
title = {Experiments with Non-Termination Analysis for Java Bytecode},
booktitle = {Proceedings of the Fourth Workshop on Bytecode Semantics, Verification,
Analysis and Transformation, BYTECODE@ETAPS 2009, York, UK, March
29, 2009},
series = {Electronic Notes in Theoretical Computer Science},
volume = {253},
number = {5},
pages = {83--96},
publisher = {Elsevier},
year = {2009},
url = {https://doi.org/10.1016/j.entcs.2009.11.016},
doi = {10.1016/J.ENTCS.2009.11.016},
timestamp = {Fri, 24 Feb 2023 15:28:28 +0100},
biburl = {https://dblp.org/rec/journals/entcs/PayetS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Payet08,
author = {{\'{E}}tienne Payet},
title = {Loop detection in term rewriting using the eliminating unfoldings},
journal = {Theor. Comput. Sci.},
volume = {403},
number = {2-3},
pages = {307--327},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.05.013},
doi = {10.1016/J.TCS.2008.05.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Payet08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0807-3451,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
title = {A Non-Termination Criterion for Binary Constraint Logic Programs},
journal = {CoRR},
volume = {abs/0807.3451},
year = {2008},
url = {http://arxiv.org/abs/0807.3451},
eprinttype = {arXiv},
eprint = {0807.3451},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0807-3451.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sas/PayetS07,
author = {{\'{E}}tienne Payet and
Fausto Spoto},
editor = {Hanne Riis Nielson and
Gilberto Fil{\'{e}}},
title = {Magic-Sets Transformation for the Analysis of Java Bytecode},
booktitle = {Static Analysis, 14th International Symposium, {SAS} 2007, Kongens
Lyngby, Denmark, August 22-24, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4634},
pages = {452--467},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74061-2\_28},
doi = {10.1007/978-3-540-74061-2\_28},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sas/PayetS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toplas/PayetM06,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
title = {Nontermination inference of logic programs},
journal = {{ACM} Trans. Program. Lang. Syst.},
volume = {28},
number = {2},
pages = {256--289},
year = {2006},
url = {https://doi.org/10.1145/1119479.1119481},
doi = {10.1145/1119479.1119481},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toplas/PayetM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lopstr/Payet06,
author = {{\'{E}}tienne Payet},
editor = {Germ{\'{a}}n Puebla},
title = {Detecting Non-termination of Term Rewriting Systems Using an Unfolding
Operator},
booktitle = {Logic-Based Program Synthesis and Transformation, 16th International
Symposium, {LOPSTR} 2006, Venice, Italy, July 12-14, 2006, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4407},
pages = {194--209},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-3-540-71410-1\_14},
doi = {10.1007/978-3-540-71410-1\_14},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/lopstr/Payet06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpe/PayetM05,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
editor = {Alexander Serebrenik and
Susana Mu{\~{n}}oz{-}Hern{\'{a}}ndez},
title = {An Improved Non-Termination Criterion for Binary Constraint Logic
Programs},
booktitle = {Proceedings of the 15th International Workshop on Logic Programming
Environments, Sitges (Barcelona), Spain, October 5, 2005},
pages = {46--60},
year = {2005},
url = {http://arxiv.org/abs/cs.pl/0508106},
timestamp = {Fri, 05 Feb 2021 11:07:04 +0100},
biburl = {https://dblp.org/rec/conf/lpe/PayetM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0508106,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
title = {An Improved Non-Termination Criterion for Binary Constraint Logic
Programs},
journal = {CoRR},
volume = {abs/cs/0508106},
year = {2005},
url = {http://arxiv.org/abs/cs/0508106},
eprinttype = {arXiv},
eprint = {cs/0508106},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0508106.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jfplc/PayetM04,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
editor = {Fr{\'{e}}d{\'{e}}ric Mesnard},
title = {Inf{\'{e}}rence de non-terminaison pour les programmes logiques
avec contraintes},
booktitle = {Programmation en logique avec contraintes, {JFPLC} 2004, 21, 22 et
23 Juin 2004, Angers, France},
publisher = {Hermes},
year = {2004},
timestamp = {Mon, 24 May 2004 15:54:02 +0200},
biburl = {https://dblp.org/rec/conf/jfplc/PayetM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sas/PayetM04,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
editor = {Roberto Giacobazzi},
title = {Non-termination Inference for Constraint Logic Programs},
booktitle = {Static Analysis, 11th International Symposium, {SAS} 2004, Verona,
Italy, August 26-28, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3148},
pages = {377--392},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27864-1\_27},
doi = {10.1007/978-3-540-27864-1\_27},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/sas/PayetM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-PL-0406041,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
title = {Non-Termination Inference of Logic Programs},
journal = {CoRR},
volume = {cs.PL/0406041},
year = {2004},
url = {http://arxiv.org/abs/cs/0406041},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-PL-0406041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jfplc/MesnardPN02,
author = {Fr{\'{e}}d{\'{e}}ric Mesnard and
{\'{E}}tienne Payet and
Ulrich Neumerkel},
editor = {Michel Rueher},
title = {Non-Termination Inference for Optimal Termination Conditions of Logic
Programs},
booktitle = {Programmation en logique avec contraintes, {JFPLC} 2002, 27-30 Mai
2002, Universit{\'{e}} de Nice Sophia-Antipolis, France},
pages = {87},
year = {2002},
timestamp = {Mon, 24 May 2004 15:53:56 +0200},
biburl = {https://dblp.org/rec/conf/jfplc/MesnardPN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sas/MesnardPN02,
author = {Fr{\'{e}}d{\'{e}}ric Mesnard and
{\'{E}}tienne Payet and
Ulrich Neumerkel},
editor = {Manuel V. Hermenegildo and
Germ{\'{a}}n Puebla},
title = {Detecting Optimal Termination Conditions of Logic Programs},
booktitle = {Static Analysis, 9th International Symposium, {SAS} 2002, Madrid,
Spain, September 17-20, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2477},
pages = {509--526},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45789-5\_35},
doi = {10.1007/3-540-45789-5\_35},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/sas/MesnardPN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-LO-0212026,
author = {{\'{E}}tienne Payet and
Fr{\'{e}}d{\'{e}}ric Mesnard},
title = {A Generalization of the Lifting Lemma for Logic Programming},
journal = {CoRR},
volume = {cs.LO/0212026},
year = {2002},
url = {http://arxiv.org/abs/cs/0212026},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-LO-0212026.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jfplc/MesnardNP01,
author = {Fr{\'{e}}d{\'{e}}ric Mesnard and
Ulrich Neumerkel and
{\'{E}}tienne Payet},
editor = {Philippe Codognet},
title = {cTI: un outil pour l'inf{\'{e}}rence de conditions optimales
de terminasion pour Prolog},
booktitle = {Programmation en logique avec contraintes, Actes des JFPLC'2001, 24
avril - 27 avril 2001, Cit{\'{e}} des sciences et de l'industrie,
Paris, France},
pages = {271--286},
publisher = {Hermes},
year = {2001},
timestamp = {Sat, 23 Jun 2018 18:47:29 +0200},
biburl = {https://dblp.org/rec/conf/jfplc/MesnardNP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/Payet00,
author = {{\'{E}}tienne Payet},
title = {Produit Synchronis{\'{e}} pour Quelques Classes de Graphes Infinis},
school = {University of La R{\'{e}}union, Saint-Denis, France},
year = {2000},
url = {https://tel.archives-ouvertes.fr/tel-00468099},
timestamp = {Tue, 21 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/hal/Payet00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/Payet00,
author = {{\'{E}}tienne Payet},
title = {Thue Specifications, Infinite Graphs and Synchronized Product},
journal = {Fundam. Informaticae},
volume = {44},
number = {3},
pages = {265--290},
year = {2000},
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi44-3-03},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/Payet00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/KnapikP99,
author = {Teodor Knapik and
{\'{E}}tienne Payet},
editor = {Gabriel Ciobanu and
Gheorghe Paun},
title = {Synchronized Product of Linear Bounded Machines},
booktitle = {Fundamentals of Computation Theory, 12th International Symposium,
{FCT} '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1684},
pages = {362--373},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48321-7\_30},
doi = {10.1007/3-540-48321-7\_30},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/KnapikP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KnapikP98,
author = {Teodor Knapik and
{\'{E}}tienne Payet},
title = {The Full Quotient and its Closure Property for Regular Languages},
journal = {Inf. Process. Lett.},
volume = {65},
number = {2},
pages = {57--62},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(97)00218-4},
doi = {10.1016/S0020-0190(97)00218-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KnapikP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
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:
