Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Étienne
    Last name: Payet
    DBLP: 00/5618
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 25 of 25  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Étienne Payet, Fausto Spoto.
    An operational semantics for android activities.
    Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, PEPM 2014, January 20-21, 2014, San Diego, California, USA 2014 (0) 2014
    Journal article
    Étienne Payet, Frédéric Mesnard, Fausto Spoto.
    Non-Termination Analysis of Java Bytecode.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Étienne Payet, Fausto Spoto.
    Static analysis of Android programs.
    Information Software Technology 2012, Volume 54 (0) 2012
    Conference paper
    Étienne Payet, Fausto Spoto.
    Static Analysis of Android Programs.
    Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings 2011 (0) 2011
    Journal article
    Fausto Spoto, Étienne Payet.
    Magic-sets for localised analysis of Java bytecode.
    Higher-Order and Symbolic Computation 2010, Volume 23 (0) 2010
    Conference paper
    Fausto Spoto, Frédéric Mesnard, Étienne Payet.
    A termination analyzer for Java bytecode based on path-length.
    ACM Trans. Program. Lang. Syst. 2010, Volume 32 (0) 2010
    Conference paper
    Étienne Payet, Fausto Spoto.
    Experiments with Non-Termination Analysis for Java Bytecode.
    Electr. Notes Theor. Comput. Sci. 2009, Volume 253 (0) 2009
    Conference paper
    Étienne Payet, Frédéric Mesnard.
    A non-termination criterion for binary constraint logic programs.
    TPLP 2009, Volume 9 (0) 2009
    Conference paper
    Étienne Payet, Frédéric Mesnard.
    A Non-Termination Criterion for Binary Constraint Logic Programs
    CoRR 2008, Volume 0 (0) 2008
    Conference paper
    Étienne Payet.
    Loop detection in term rewriting using the eliminating unfoldings.
    Theor. Comput. Sci. 2008, Volume 403 (0) 2008
    Conference paper
    Étienne Payet, Fausto Spoto.
    Magic-Sets Transformation for the Analysis of Java Bytecode.
    Static Analysis, 14th International Symposium, SAS 2007, Kongens Lyngby, Denmark, August 22-24, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Étienne Payet.
    Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator.
    Logic-Based Program Synthesis and Transformation, 16th International Symposium, LOPSTR 2006, Venice, Italy, July 12-14, 2006, Revised Selected Papers 2007 (0) 2006
    Conference paper
    Étienne Payet, Frédéric Mesnard.
    Nontermination inference of logic programs.
    ACM Trans. Program. Lang. Syst. 2006, Volume 28 (0) 2006
    Conference paper
    Étienne Payet, Frédéric Mesnard.
    An Improved Non-Termination Criterion for Binary Constraint Logic Programs.
    Proceedings of the 15th International Workshop on Logic Programming Environments, Sitges (Barcelona), October 5, 2005 2005 (0) 2005
    Conference paper
    Étienne Payet, Frédéric Mesnard.
    An Improved Non-Termination Criterion for Binary Constraint Logic Programs
    CoRR 2005, Volume 0 (0) 2005
    Conference paper
    Étienne Payet, Frédéric Mesnard.
    Inférence de non-terminaison pour les programmes logiques avec contraintes.
    Programmation en logique avec contraintes, JFPLC 2004, 21, 22 et 23 Juin 2004, Angers, France 2004 (0) 2004
    Conference paper
    Étienne Payet, Frédéric Mesnard.
    Non-termination Inference for Constraint Logic Programs.
    Static Analysis, 11th International Symposium, SAS 2004, Verona, Italy, August 26-28, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Étienne Payet, Frédéric Mesnard.
    Non-Termination Inference of Logic Programs
    CoRR 2004, Volume 0 (0) 2004
    Conference paper
    Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel.
    Non-Termination Inference for Optimal Termination Conditions of Logic Programs.
    Programmation en logique avec contraintes, JFPLC 2002, 27-30 Mai 2002, Université de Nice Sophia-Antipolis, France 2002 (0) 2002
    Conference paper
    Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel.
    Detecting Optimal Termination Conditions of Logic Programs.
    Static Analysis, 9th International Symposium, SAS 2002, Madrid, Spain, September 17-20, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Étienne Payet, Frédéric Mesnard.
    A Generalization of the Lifting Lemma for Logic Programming
    CoRR 2002, Volume 0 (0) 2002
    Conference paper
    Frédéric Mesnard, Ulrich Neumerkel, Étienne Payet.
    cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog.
    Programmation en logique avec contraintes, Actes des JFPLC'2001, 24 avril - 27 avril 2001, Cité des sciences et de l'industrie, Paris 2001 (0) 2001
    Conference paper
    Étienne Payet.
    Thue Specifications, Infinite Graphs and Synchronized Product.
    Fundam. Inform. 2000, Volume 44 (0) 2000
    Conference paper
    Teodor Knapik, Étienne Payet.
    Synchronized Product of Linear Bounded Machines.
    Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings 1999 (0) 1999
    Conference paper
    Teodor Knapik, Étienne Payet.
    The Full Quotient and its Closure Property for Regular Languages.
    Inf. Process. Lett. 1998, Volume 65 (0) 1998
    Show item 1 to 25 of 25  

    Your query returned 25 matches in the database.