|
Search the dblp DataBase
Samir Genaim:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Samir Genaim, Michael Codish
The Def-inite Approach to Dependency Analysis. [Citation Graph (0, 0)][DBLP] ESOP, 2001, pp:417-432 [Conf]
- Samir Genaim, Andy King
Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. [Citation Graph (0, 0)][DBLP] ESOP, 2003, pp:84-98 [Conf]
- Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey
Higher-Precision Groundness Analysis. [Citation Graph (0, 0)][DBLP] ICLP, 2001, pp:135-149 [Conf]
- Andy King, Lunjin Lu, Samir Genaim
Detecting Determinacy in Prolog Programs. [Citation Graph (0, 0)][DBLP] ICLP, 2006, pp:132-147 [Conf]
- Samir Genaim, Michael Codish
Inferring Termination Conditions for Logic Programs Using Backwards Analysis. [Citation Graph (0, 0)][DBLP] LPAR, 2001, pp:685-694 [Conf]
- Michael Codish, Samir Genaim
Proving Termination One Loop at a Time. [Citation Graph (0, 0)][DBLP] WLPE, 2003, pp:48-59 [Conf]
- Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof
Reuse of Results in Termination Analysis of Typed Logic Programs. [Citation Graph (0, 0)][DBLP] SAS, 2002, pp:477-492 [Conf]
- Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon
Combining Norms to Prove Termination. [Citation Graph (0, 0)][DBLP] VMCAI, 2002, pp:126-138 [Conf]
- Samir Genaim, Fausto Spoto
Information Flow Analysis for Java Bytecode. [Citation Graph (0, 0)][DBLP] VMCAI, 2005, pp:346-362 [Conf]
- Samir Genaim, Michael Codish
Inferring Termination Conditions for Logic Programs using Backwards Analysis [Citation Graph (0, 0)][DBLP] CoRR, 2003, v:0, n:, pp:- [Journal]
- Samir Genaim, Michael Codish
Inferring Termination Conditions for Logic Programs using Backwards Analysis. [Citation Graph (0, 0)][DBLP] TPLP, 2005, v:5, n:1-2, pp:75-91 [Journal]
- Samir Genaim, Jacob M. Howe, Michael Codish
Worst-case groundness analysis using definite boolean functions. [Citation Graph (0, 0)][DBLP] TPLP, 2001, v:1, n:5, pp:611-615 [Journal]
- Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini
Cost Analysis of Java Bytecode. [Citation Graph (0, 0)][DBLP] ESOP, 2007, pp:157-172 [Conf]
- Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa
Heap space analysis for java bytecode. [Citation Graph (0, 0)][DBLP] ISMM, 2007, pp:105-116 [Conf]
- Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini
Experiments in Cost Analysis of Java Bytecode. [Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2007, v:190, n:1, pp:67-83 [Journal]
- Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof
Termination analysis of logic programs through combination of type-based norms. [Citation Graph (0, 0)][DBLP] ACM Trans. Program. Lang. Syst., 2007, v:29, n:2, pp:- [Journal]
Asymptotic Resource Usage Bounds. [Citation Graph (, )][DBLP]
Field-Sensitive Value Analysis by Field-Insensitive Analysis. [Citation Graph (, )][DBLP]
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. [Citation Graph (, )][DBLP]
Termination Analysis of Java Bytecode. [Citation Graph (, )][DBLP]
Resource Usage Analysis and Its Application to Resource Certification. [Citation Graph (, )][DBLP]
Live heap space analysis for languages with garbage collection. [Citation Graph (, )][DBLP]
Parametric inference of memory requirements for garbage collected languages. [Citation Graph (, )][DBLP]
A declarative encoding of telecommunications feature subscription in SAT. [Citation Graph (, )][DBLP]
Removing useless variables in cost analysis of Java bytecode. [Citation Graph (, )][DBLP]
From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis. [Citation Graph (, )][DBLP]
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. [Citation Graph (, )][DBLP]
Cost Relation Systems: A Language-Independent Target Language for Cost Analysis. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Search in 0.032secs, Finished in 0.033secs
|