Samir Genaim

Samir Genaim, Damiano Zanardini: Reachability-based acyclicity analysis by Abstract Interpretation. Theor. Comput. Sci. 474: 60-79 (2013)

Amir M. Ben-Amram, Samir Genaim: On the linear ranking problem for integer linear-constraint loops. POPL 2013: 51-62

Pierre Ganty, Samir Genaim: Proving Termination Starting from the End. CoRR abs/1302.4539 (2013)

Elvira Albert, Puri Arenas, Samir Genaim, German Puebla, Damiano Zanardini: Cost analysis of object-oriented bytecode programs. Theor. Comput. Sci. 413(1): 142-159 (2012)

Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud: On the Termination of Integer Loops. ACM Trans. Program. Lang. Syst. 34(4): 16 (2012)

Elvira Albert, Richard Bubel, Samir Genaim, Reiner Hähnle, Guillermo Román-Díez: Verified Resource Guarantees for Heap Manipulating Programs. FASE 2012: 130-145

Elvira Albert, Antonio Flores-Montoya, Samir Genaim: Analysis of May-Happen-in-Parallel in Concurrent Objects. FMOODS/FORTE 2012: 35-51

Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, Germán Puebla: Automatic Inference of Resource Consumption Bounds. LPAR 2012: 1-11

Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, Germán Puebla: COSTABS: a cost and termination analyzer for ABS. PEPM 2012: 151-154

Diego Esteban Alonso-Blas, Samir Genaim: On the Limits of the Classical Approach to Cost Analysis. SAS 2012: 405-421

Elvira Albert, Antonio Flores-Montoya, Samir Genaim: MayPar: a may-happen-in-parallel analyzer for concurrent objects. SIGSOFT FSE 2012: 14

Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud: On the Termination of Integer Loops. VMCAI 2012: 72-87

Samir Genaim, Damiano Zanardini: Reachability-based Acyclicity Analysis by Abstract Interpretation. CoRR abs/1206.2188 (2012)

Amir M. Ben-Amram, Samir Genaim: On the Linear Ranking Problem for Integer Linear-Constraint Loops. CoRR abs/1208.4041 (2012)

Diego Esteban Alonso-Blas, Puri Arenas, Samir Genaim: Handling Non-linear Operations in the Value Analysis of COSTA. Electr. Notes Theor. Comput. Sci. 279(1): 3-17 (2011)

Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla: Closed-Form Upper Bounds in Static Cost Analysis. J. Autom. Reasoning 46(2): 161-203 (2011)

Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, German Puebla: Cost Analysis of Concurrent OO Programs. APLAS 2011: 238-254

Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa, Einar Broch Johnsen, Rudolf Schlatte, Silvia Lizeth Tapia Tarifa: Simulating Concurrent Behaviors with Worst-Case Cost Bounds. FM 2011: 353-368

Elvira Albert, Puri Arenas, Samir Genaim, Damiano Zanardini: Task-level analysis for a language with async/finish parallelism. LCTES 2011: 21-30

Elvira Albert, Richard Bubel, Samir Genaim, Reiner Hähnle, Germán Puebla, Guillermo Román-Díez: Verified resource guarantees using COSTA and KeY. PEPM 2011: 73-76

Elvira Albert, Samir Genaim, Abu Naser Masud: More Precise Yet Widely Applicable Cost Analysis. VMCAI 2011: 38-53

Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa: Parametric inference of memory requirements for garbage collected languages. ISMM 2010: 121-130

Elvira Albert, Puri Arenas, Samir Genaim, German Puebla, Diana V. Ramírez-Deantes: From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis. SAS 2010: 100-116

Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla: Cost Relation Systems: A Language-Independent Target Language for Cost Analysis. Electr. Notes Theor. Comput. Sci. 248: 31-46 (2009)

Elvira Albert, Samir Genaim: Preface. Electr. Notes Theor. Comput. Sci. 253(5): 1-2 (2009)

Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, German Puebla, Diana V. Ramírez-Deantes, Guillermo Román-Díez, Damiano Zanardini: Termination and Cost Analysis with COSTA and its User Interfaces. Electr. Notes Theor. Comput. Sci. 258(1): 109-121 (2009)

Elvira Albert, Diego Esteban Alonso-Blas, Puri Arenas, Samir Genaim, German Puebla: Asymptotic Resource Usage Bounds. APLAS 2009: 294-310

Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla: Field-Sensitive Value Analysis by Field-Insensitive Analysis. FM 2009: 370-386

Elvira Albert, Puri Arenas, Samir Genaim, Israel Herraiz, German Puebla: Comparing Cost Functions in Resource Analysis. FOPARA 2009: 1-17

Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini: Resource Usage Analysis and Its Application to Resource Certification. FOSAD 2009: 258-288

Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa: Live heap space analysis for languages with garbage collection. ISMM 2009: 129-138

Michael Codish, Samir Genaim, Peter J. Stuckey: A declarative encoding of telecommunications feature subscription in SAT. PPDP 2009: 255-266

Samir Genaim, Andy King: Inferring non-suspension conditions for logic programs with dynamic scheduling. ACM Trans. Comput. Log. 9(3) (2008)

Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini: Termination Analysis of Java Bytecode. FMOODS 2008: 2-18

Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini: Removing useless variables in cost analysis of Java bytecode. SAC 2008: 368-375

Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla: Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. SAS 2008: 221-237

Elvira 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)

Maurice 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)

Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini: Cost Analysis of Java Bytecode. ESOP 2007: 157-172

Elvira 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

Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa: Heap space analysis for java bytecode. ISMM 2007: 105-116

Andy King, Lunjin Lu, Samir Genaim: Detecting Determinacy in Prolog Programs. ICLP 2006: 132-147

Samir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs using Backwards Analysis. TPLP 5(1-2): 75-91 (2005)

Samir Genaim, Fausto Spoto: Information Flow Analysis for Java Bytecode. VMCAI 2005: 346-362

Samir Genaim, Andy King: Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. ESOP 2003: 84-98

Michael Codish, Samir Genaim: Proving Termination One Loop at a Time. WLPE 2003: 48-59

Samir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs using Backwards Analysis. CoRR cs.PL/0312023 (2003)

Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof: Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002: 477-492

Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon: Combining Norms to Prove Termination. VMCAI 2002: 126-138

Samir Genaim, Jacob M. Howe, Michael Codish: Worst-case groundness analysis using definite boolean functions. TPLP 1(5): 611-615 (2001)

Samir Genaim, Michael Codish: The Def-inite Approach to Dependency Analysis. ESOP 2001: 417-432

Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey: Higher-Precision Groundness Analysis. ICLP 2001: 135-149

Samir Genaim, Michael Codish: Inferring Termination Conditions for Logic Programs Using Backwards Analysis. LPAR 2001: 685-694