dblp.uni-trier.dewww.uni-trier.de

Samir Genaim

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
21EEElvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini: Termination Analysis of Java Bytecode. FMOODS 2008: 2-18
20EEElvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini: Removing useless variables in cost analysis of Java bytecode. SAC 2008: 368-375
19EEElvira Albert, Puri Arenas, Samir Genaim, Germán Puebla: Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. SAS 2008: 221-237
18EESamir Genaim, Andy King: Inferring non-suspension conditions for logic programs with dynamic scheduling. ACM Trans. Comput. Log. 9(3): (2008)
2007
17EEElvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini: Cost Analysis of Java Bytecode. ESOP 2007: 157-172
16EEElvira Albert, Puri Arenas, Samir Genaim, German Puebla, Damiano Zanardini: COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. FMCO 2007: 113-132
15EEElvira Albert, Samir Genaim, Miguel Gómez-Zamalloa: Heap space analysis for java bytecode. ISMM 2007: 105-116
14EEMaurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof: Termination analysis of logic programs through combination of type-based norms. ACM Trans. Program. Lang. Syst. 29(2): (2007)
13EEElvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini: Experiments in Cost Analysis of Java Bytecode. Electr. Notes Theor. Comput. Sci. 190(1): 67-83 (2007)
2006
12EEAndy King, Lunjin Lu, Samir Genaim: Detecting Determinacy in Prolog Programs. ICLP 2006: 132-147
2005
11EESamir Genaim, Fausto Spoto: Information Flow Analysis for Java Bytecode. VMCAI 2005: 346-362
10EESamir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs using Backwards Analysis. TPLP 5(1-2): 75-91 (2005)
2003
9EESamir Genaim, Andy King: Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. ESOP 2003: 84-98
8 Michael Codish, Samir Genaim: Proving Termination One Loop at a Time. WLPE 2003: 48-59
7EESamir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs using Backwards Analysis CoRR cs.PL/0312023: (2003)
2002
6EEMaurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof: Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002: 477-492
5EESamir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon: Combining Norms to Prove Termination. VMCAI 2002: 126-138
2001
4EESamir Genaim, Michael Codish: The Def-inite Approach to Dependency Analysis. ESOP 2001: 417-432
3EEMichael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey: Higher-Precision Groundness Analysis. ICLP 2001: 135-149
2EESamir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs Using Backwards Analysis. LPAR 2001: 685-694
1 Samir Genaim, Jacob M. Howe, Michael Codish: Worst-case groundness analysis using definite boolean functions. TPLP 1(5): 611-615 (2001)

Coauthor Index

1Elvira Albert [13] [15] [16] [17] [19] [20] [21]
2Puri Arenas (Puri Arenas-Sánchez) [13] [16] [17] [19] [20] [21]
3Maurice Bruynooghe [6] [14]
4Michael Codish [1] [2] [3] [4] [5] [6] [7] [8] [10] [14] [21]
5John P. Gallagher [5] [14]
6Miguel Gómez-Zamalloa [15]
7Jacob M. Howe [1]
8Andy King [9] [12] [18]
9Vitaly Lagoon [5]
10Lunjin Lu [12]
11Germán Puebla (German Puebla) [13] [16] [17] [19] [20] [21]
12Harald Søndergaard [3]
13Fausto Spoto [11]
14Peter J. Stuckey [3]
15Wim Vanhoof [6] [14]
16Damiano Zanardini [13] [16] [17] [20] [21]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)