Étienne Payet

According to our database1, Étienne Payet authored at least 39 papers between 1998 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Guided Unfoldings for Finding Loops in Standard Term Rewriting.
CoRR, 2018

Checking Array Bounds by Abstract Interpretation and Symbolic Expressions.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
Selective unification in constraint logic programming.
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

2016
On the Completeness of Selective Unification in Concolic Testing of Logic Programs.
CoRR, 2016

On the Linear Ranking Problem for Simple Floating-Point Loops.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

Termination analysis of floating-point programs using parameterizable rational approximations.
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Towards a framework for algorithm recognition in binary code.
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

On the Completeness of Selective Unification in Concolic Testing of Logic Programs.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2016

2015
Concolic testing in logic programming.
TPLP, 2015

A second-order formulation of non-termination.
Inf. Process. Lett., 2015

Concolic Testing in Logic Programming.
CoRR, 2015

2014
Non-Termination Analysis of Java Bytecode.
CoRR, 2014

Non-termination of Dalvik bytecode via compilation to CLP.
CoRR, 2014

A Second-Order Formulation of Non-Termination.
CoRR, 2014

An operational semantics for android activities.
Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, 2014

2012
Static analysis of Android programs.
Information & Software Technology, 2012

2011
Static Analysis of Android Programs.
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

2010
A termination analyzer for Java bytecode based on path-length.
ACM Trans. Program. Lang. Syst., 2010

Magic-sets for localised analysis of Java bytecode.
Higher-Order and Symbolic Computation, 2010

2009
A non-termination criterion for binary constraint logic programs.
TPLP, 2009

Experiments with Non-Termination Analysis for Java Bytecode.
Electr. Notes Theor. Comput. Sci., 2009

2008
Loop detection in term rewriting using the eliminating unfoldings.
Theor. Comput. Sci., 2008

A Non-Termination Criterion for Binary Constraint Logic Programs
CoRR, 2008

2007
Magic-Sets Transformation for the Analysis of Java Bytecode.
Proceedings of the Static Analysis, 14th International Symposium, 2007

2006
Nontermination inference of logic programs.
ACM Trans. Program. Lang. Syst., 2006

Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2006

2005
An Improved Non-Termination Criterion for Binary Constraint Logic Programs
CoRR, 2005

An Improved Non-Termination Criterion for Binary Constraint Logic Programs.
Proceedings of the 15th International Workshop on Logic Programming Environments, 2005

2004
Non-Termination Inference of Logic Programs
CoRR, 2004

Non-termination Inference for Constraint Logic Programs.
Proceedings of the Static Analysis, 11th International Symposium, 2004

Inférence de non-terminaison pour les programmes logiques avec contraintes.
Proceedings of the Programmation en logique avec contraintes, 2004

2002
A Generalization of the Lifting Lemma for Logic Programming
CoRR, 2002

Detecting Optimal Termination Conditions of Logic Programs.
Proceedings of the Static Analysis, 9th International Symposium, 2002

Non-Termination Inference for Optimal Termination Conditions of Logic Programs.
Proceedings of the Programmation en logique avec contraintes, 2002

2001
cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog.
Proceedings of the Programmation en logique avec contraintes, Actes des JFPLC'2001, 24 avril, 2001

2000
Produit Synchronisé pour Quelques Classes de Graphes Infinis.
PhD thesis, 2000

Thue Specifications, Infinite Graphs and Synchronized Product.
Fundam. Inform., 2000

1999
Synchronized Product of Linear Bounded Machines.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
The Full Quotient and its Closure Property for Regular Languages.
Inf. Process. Lett., 1998


  Loading...