Étienne Payet

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2012
j9		Étienne Payet, Fausto Spoto: Static analysis of Android programs. Information & Software Technology 54(11): 1192-1201 (2012)
	2011
c10		Étienne Payet, Fausto Spoto: Static Analysis of Android Programs. CADE 2011: 439-445
	2010
j8		Fausto Spoto, Étienne Payet: Magic-sets for localised analysis of Java bytecode. Higher-Order and Symbolic Computation 23(1): 29-86 (2010)
j7		Fausto Spoto, Fred Mesnard, Étienne Payet: A termination analyzer for Java bytecode based on path-length. ACM Trans. Program. Lang. Syst. 32(3) (2010)
	2009
j6		Étienne Payet, Fausto Spoto: Experiments with Non-Termination Analysis for Java Bytecode. Electr. Notes Theor. Comput. Sci. 253(5): 83-96 (2009)
j5		Étienne Payet, Frédéric Mesnard: A non-termination criterion for binary constraint logic programs. TPLP 9(2): 145-164 (2009)
	2008
j4		Étienne Payet: Loop detection in term rewriting using the eliminating unfoldings. Theor. Comput. Sci. 403(2-3): 307-327 (2008)
i4		Étienne Payet, Frédéric Mesnard: A Non-Termination Criterion for Binary Constraint Logic Programs. CoRR abs/0807.3451 (2008)
	2007
c9		Étienne Payet, Fausto Spoto: Magic-Sets Transformation for the Analysis of Java Bytecode. SAS 2007: 452-467
	2006
j3		Étienne Payet, Frédéric Mesnard: Nontermination inference of logic programs. ACM Trans. Program. Lang. Syst. 28(2): 256-289 (2006)
c8		Étienne Payet: Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator. LOPSTR 2006: 194-209
	2005
c7		Étienne Payet, Frédéric Mesnard: An Improved Non-Termination Criterion for Binary Constraint Logic Programs. WLPE 2005: 46-60
i3		Étienne Payet, Frédéric Mesnard: An Improved Non-Termination Criterion for Binary Constraint Logic Programs. CoRR abs/cs/0508106 (2005)
	2004
c6		Étienne Payet, Frédéric Mesnard: Inférence de non-terminaison pour les programmes logiques avec contraintes. JFPLC 2004
c5		Étienne Payet, Frédéric Mesnard: Non-termination Inference for Constraint Logic Programs. SAS 2004: 377-392
i2		Étienne Payet, Frédéric Mesnard: Non-Termination Inference of Logic Programs. CoRR cs.PL/0406041 (2004)
	2002
c4		Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel: Non-Termination Inference for Optimal Termination Conditions of Logic Programs. JFPLC 2002: 87-
c3		Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel: Detecting Optimal Termination Conditions of Logic Programs. SAS 2002: 509-526
i1		Étienne Payet, Frédéric Mesnard: A Generalization of the Lifting Lemma for Logic Programming. CoRR cs.LO/0212026 (2002)
	2001
c2		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
j2		Étienne Payet: Thue Specifications, Infinite Graphs and Synchronized Product. Fundam. Inform. 44(3): 265-290 (2000)
	1999
c1		Teodor Knapik, Étienne Payet: Synchronized Product of Linear Bounded Machines. FCT 1999: 362-373
	1998
j1		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	[c1] [j1]
2	Frédéric Mesnard (Fred Mesnard)	[j7] [j5] [i4] [j3] [c7] [i3] [c6] [c5] [i2] [c4] [c3] [i1] [c2]
3	Ulrich Neumerkel	[c4] [c3] [c2]
4	Fausto Spoto	[j9] [c10] [j8] [j7] [j6] [c9]

Last update Sat May 25 17:49:09 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page