Étienne Payet

	2011
22		Étienne Payet, Fausto Spoto: Static Analysis of Android Programs. CADE 2011: 439-445
	2010
21		Fausto Spoto, Fred Mesnard, Étienne Payet: A termination analyzer for Java bytecode based on path-length. ACM Trans. Program. Lang. Syst. 32(3): (2010)
20		Fausto Spoto, Étienne Payet: Magic-sets for localised analysis of Java bytecode. Higher-Order and Symbolic Computation 23(1): 29-86 (2010)
	2009
19		Étienne Payet, Fausto Spoto: Experiments with Non-Termination Analysis for Java Bytecode. Electr. Notes Theor. Comput. Sci. 253(5): 83-96 (2009)
18		Étienne Payet, Frédéric Mesnard: A non-termination criterion for binary constraint logic programs. TPLP 9(2): 145-164 (2009)
	2008
17		Étienne Payet, Frédéric Mesnard: A Non-Termination Criterion for Binary Constraint Logic Programs CoRR abs/0807.3451: (2008)
16		Étienne Payet: Loop detection in term rewriting using the eliminating unfoldings. Theor. Comput. Sci. 403(2-3): 307-327 (2008)
	2007
15		Étienne Payet, Fausto Spoto: Magic-Sets Transformation for the Analysis of Java Bytecode. SAS 2007: 452-467
	2006
14		Étienne Payet: Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator. LOPSTR 2006: 194-209
13		Étienne Payet, Frédéric Mesnard: Nontermination inference of logic programs. ACM Trans. Program. Lang. Syst. 28(2): 256-289 (2006)
	2005
12		Étienne Payet, Frédéric Mesnard: An Improved Non-Termination Criterion for Binary Constraint Logic Programs. WLPE 2005: 46-60
11		Étienne Payet, Frédéric Mesnard: An Improved Non-Termination Criterion for Binary Constraint Logic Programs CoRR abs/cs/0508106: (2005)
	2004
10		Étienne Payet, Frédéric Mesnard: Inférence de non-terminaison pour les programmes logiques avec contraintes. JFPLC 2004
9		Étienne Payet, Frédéric Mesnard: Non-termination Inference for Constraint Logic Programs. SAS 2004: 377-392
8		Étienne Payet, Frédéric Mesnard: Non-Termination Inference of Logic Programs CoRR cs.PL/0406041: (2004)
	2002
7		Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel: Non-Termination Inference for Optimal Termination Conditions of Logic Programs. JFPLC 2002: 87-
6		Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel: Detecting Optimal Termination Conditions of Logic Programs. SAS 2002: 509-526
5		Étienne Payet, Frédéric Mesnard: A Generalization of the Lifting Lemma for Logic Programming CoRR cs.LO/0212026: (2002)
	2001
4		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
3		Étienne Payet: Thue Specifications, Infinite Graphs and Synchronized Product. Fundam. Inform. 44(3): 265-290 (2000)
	1999
2		Teodor Knapik, Étienne Payet: Synchronized Product of Linear Bounded Machines. FCT 1999: 362-373
	1998
1		Teodor Knapik, Étienne Payet: The Full Quotient and its Closure Property for Regular Languages. Inf. Process. Lett. 65(2): 57-62 (1998)

Coauthor Index

1	Teodor Knapik	[1] [2]
2	Frédéric Mesnard (Fred Mesnard)	[4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [17] [18] [21]
3	Ulrich Neumerkel	[4] [6] [7]
4	Fausto Spoto	[15] [19] [20] [21] [22]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page