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 10 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
    Show item 1 to 10 of 25  

    Your query returned 25 matches in the database.