Search the dblp DataBase

Publications of Author

1. Samir Genaim, Michael Codish
   The Def-inite Approach to Dependency Analysis. [Citation Graph (0, 0)][DBLP]
   ESOP, 2001, pp:417-432 [Conf]
   
2. 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]
   
3. 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]
   
4. Andy King, Lunjin Lu, Samir Genaim
   Detecting Determinacy in Prolog Programs. [Citation Graph (0, 0)][DBLP]
   ICLP, 2006, pp:132-147 [Conf]
   
5. Samir Genaim, Michael Codish
   Inferring Termination Conditions for Logic Programs Using Backwards Analysis. [Citation Graph (0, 0)][DBLP]
   LPAR, 2001, pp:685-694 [Conf]
   
6. Michael Codish, Samir Genaim
   Proving Termination One Loop at a Time. [Citation Graph (0, 0)][DBLP]
   WLPE, 2003, pp:48-59 [Conf]
   
7. 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]
   
8. 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]
   
9. Samir Genaim, Fausto Spoto
   Information Flow Analysis for Java Bytecode. [Citation Graph (0, 0)][DBLP]
   VMCAI, 2005, pp:346-362 [Conf]
   
10. 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]
    
11. 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]
    
12. 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]
    
13. 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]
    
14. 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]
    
15. 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]
    
16. 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]
    
17. 
    Asymptotic Resource Usage Bounds. [Citation Graph (, )][DBLP]
    
    
18. 
    Field-Sensitive Value Analysis by Field-Insensitive Analysis. [Citation Graph (, )][DBLP]
    
    
19. 
    COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. [Citation Graph (, )][DBLP]
    
    
20. 
    Termination Analysis of Java Bytecode. [Citation Graph (, )][DBLP]
    
    
21. 
    Resource Usage Analysis and Its Application to Resource Certification. [Citation Graph (, )][DBLP]
    
    
22. 
    Live heap space analysis for languages with garbage collection. [Citation Graph (, )][DBLP]
    
    
23. 
    Parametric inference of memory requirements for garbage collected languages. [Citation Graph (, )][DBLP]
    
    
24. 
    A declarative encoding of telecommunications feature subscription in SAT. [Citation Graph (, )][DBLP]
    
    
25. 
    Removing useless variables in cost analysis of Java bytecode. [Citation Graph (, )][DBLP]
    
    
26. 
    From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis. [Citation Graph (, )][DBLP]
    
    
27. 
    Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. [Citation Graph (, )][DBLP]
    
    
28. 
    Cost Relation Systems: A Language-Independent Target Language for Cost Analysis. [Citation Graph (, )][DBLP]
    
    
29. 
    Preface. [Citation Graph (, )][DBLP]