Publications

This page contains a list of my publications. You can also check the one at DBLP. Please note the following copyright notice (taken from Roberto Giacobazzi web-page without permission): Calvin and Hobbes The documents distributed have been provided by the contributing authors as a means to ensure timely dissemination of technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


Journal Publications

[1] Elvira Albert, Antonio Flores-Montoya, Samir Genaim, and Enrique Martin-Martin. Rely-Guarantee Termination and Cost Analyses of Loops with Concurrent Interleavings. J. Autom. Reasoning, 59(1):47-85, 2017. [ bibtex | abstract | DOI ]

[2] Elvira Albert, Richard Bubel, Samir Genaim, Reiner Hähnle, Germán Puebla, and Guillermo Román-Díez. A Formal Verification Framework for Static Analysis - As well as its instantiation to the resource analyzer COSTA and formal verification tool KeY. Software and System Modeling, 15(4):987-1012, 2016. Published first online on 15th July 2015. [ bibtex | abstract | DOI ]

[3] Elvira Albert, Antonio Flores-Montoya, Samir Genaim, and Enrique Martin-Martin. May-Happen-in-Parallel Analysis for Actor-based Concurrency. ACM Transactions on Computational Logic, 17(2):11:1-11:39, December 2015. [ bibtex | abstract | DOI ]

[4] Elvira Albert, Puri Arenas, Jesús Correas, Samir Genaim, Miguel Gómez-Zamalloa, Germán Puebla, and Guillermo Román-Díez. Object-Sensitive Cost Analysis for Concurrent Objects. Software Testing, Verification and Reliability, 25(3):218-271, 2015. [ bibtex | abstract | DOI ]

[5] Elvira Albert, Puri Arenas, Samir Genaim, and Germán Puebla. A Practical Comparator of Cost Functions and Its Applications. Science of Computer Programming, 111(3):483-504, 2015. [ bibtex | abstract | DOI ]

[6] Damiano Zanardini and Samir Genaim. Inference of Field-Sensitive Reachability and Cyclicity. ACM Transactions on Computational Logic, 15(4):33:1-33:41, September 2014. [ bibtex | abstract | DOI | arXiv ]

[7] Amir M. Ben-Amram and Samir Genaim. Ranking Functions for Linear-Constraint Loops. Journal of the ACM, 61(4):26:1-26:55, 2014. [ bibtex | abstract | DOI | arXiv ]

[8] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Guillermo Román-Díez. Conditional Termination of Loops over Heap-allocated Data. Science of Computer Programming, 92, Part A:2 - 24, 2014. Special issue on Bytecode 2012. [ bibtex | abstract | DOI ]

[9] Samir Genaim and Damiano Zanardini. Reachability-based Acyclicity Analysis by Abstract Interpretation. Theoretical Computer Science, 474:60-79, 2013. [ bibtex | abstract | DOI ]

[10] Elvira Albert, Samir Genaim, and Miguel Gómez-Zamalloa. Heap Space Analysis for Garbage Collected Languages. Science of Computer Programming, 78(9):1427-1448, 2013. [ bibtex | abstract | DOI ]

[11] Elvira Albert, Samir Genaim, and Abu Naser Masud. On the Inference of Resource Usage Upper and Lower Bounds. ACM Transactions on Computational Logic, 14(3):22:1-22:35, 2013. [ bibtex | abstract | DOI ]

[12] Amir M. Ben-Amram, Samir Genaim, and Abu Naser Masud. On the Termination of Integer Loops. ACM Transactions on Programming Languages and Systems, 34(4):16:1-16:24, 2012. [ bibtex | abstract | DOI ]

[13] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Damiano Zanardini. Cost Analysis of Object-Oriented Bytecode Programs. Theoretical Computer Science, 413(1):142-159, 2012. [ bibtex | abstract | DOI ]

[14] Elvira Albert, Puri Arenas, Samir Genaim, and Germán Puebla. Closed-Form Upper Bounds in Static Cost Analysis. Journal of Automated Reasoning, 46(2):161-203, 2011. [ bibtex | abstract | DOI ]

[15] Samir Genaim and Andy King. Inferring non-Suspension Conditions for Logic Programs with Dynamic Scheduling. ACM Transactions on Computational Logic, 9(3):17:1-17:43, 2008. [ bibtex | abstract | DOI ]

[16] Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, and Wim Vanhoof. Termination Analysis of Logic Programs through Combination of Type-based Norms. ACM Transactions on Programming Languages and Systems, 29(2):10:1-10:44, 2007. [ bibtex | abstract | DOI ]

[17] Samir Genaim and Michael Codish. Inferring Termination Conditions for Logic Programs using Backwards Analysis. Theory and Practice of Logic Programming, 5(1-2):75-91, 2005. [ bibtex | abstract | DOI ]

[18] Samir Genaim, Jacob M. Howe, and Michael Codish. Worst-case Groundness Analysis using Definite Boolean Functions. Theory and Practice of Logic Programming, 1(5):611-615, 2001. [ bibtex | abstract | DOI ]

Conference Publications

[1] Amir M. Ben-Amram and Samir Genaim. On Multiphase-Linear Ranking Functions. In Viktor Kuncak and Rupak Majumdar, editors, Proceedings of the 29th International Conference on Computer Aided Verification (CAV'17), Lecture Notes in Computer Science. Springer, July 2017. [ bibtex | abstract ]

[2] Amir M. Ben-Amram and Samir Genaim. Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions. In Daniel Kroening and Corina Pasareanu, editors, Proceedings of the 27th International Conference on Computer Aided Verification (CAV'15), volume 9207 of Lecture Notes in Computer Science, pages 304-321. Springer, July 2015. [ bibtex | abstract | DOI ]

[3] Pierre Ganty, Samir Genaim, Ratan Lal, and Pavithra Prabhakar. From Non-Zenoness Verification to Termination. In 13. ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2015), pages 228-237. IEEE, 2015. [ bibtex | abstract | DOI ]

[4] Elvira Albert, Samir Genaim, and Pablo Gordillo. May-Happen-in-Parallel Analysis for Asynchronous Programs with Inter-Procedural Synchronization. In Sandrine Blazy and Thomas Jensen, editors, Proceedings of the 22nd International Symposium on Static Analysis (SAS'15), volume 9291 of Lecture Notes in Computer Science, pages 72-89. Springer, 2015. [ bibtex | abstract | DOI ]

[5] Elvira Albert, Puri Arenas, Jesús Correas, Samir Genaim, Miguel Gómez-Zamalloa, Enrique Martin-Martin, Germán Puebla, and Guillermo Román-Díez. Rsource Analysis: From Sequential to Concurrent and Distributed Programs. In Nikolaj Bjørner and Frank D. de Boer, editors, 20th International Symposium on Formal Methods (FM'15), volume 9109, pages 3-17. Springer, 2015. [ bibtex | abstract | DOI ]

[6] Elvira Albert, Samir Genaim, and Raúl Gutiérrez. A Transformational Approach to Resource Analysis with Typed-Norms. In Gopal Gupta and Ricardo Peña, editors, Proceedings of the 23rd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR'13), volume 8901 of Lecture Notes in Computer Science, pages 38-53. Springer, 2014. [ bibtex | abstract | DOI ]

[7] Elvira Albert, Samir Genaim, and Enrique Martin-Martin. May-Happen-in-Parallel Analysis for Priority-based Scheduling. In Ken McMillan, Aart Middeldorp, and Andrei Voronkov, editors, Proceedings of the 19th International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR-19), volume 8312 of Lecture Notes in Computer Science, pages 18-34. Springer, December 2013. [ bibtex | abstract | DOI ]

[8] Elvira Albert, Antonio Flores-Montoya, Samir Genaim, and Enrique Martin-Martin. Termination and Cost Analysis of Loops with Concurrent Interleavings. In Dang Van Hung and Mizuhito Ogawa, editors, Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 349-364. Springer, 2013. [ bibtex | abstract | DOI ]

[9] Diego Esteban Alonso Blas, Puri Arenas, and Samir Genaim. Precise Cost Analysis via Local Reasoning. In Dang Van Hung and Mizuhito Ogawa, editors, Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 319-333. Springer, 2013. [ bibtex | abstract | DOI ]

[10] Antonio Flores-Montoya, Elvira Albert, and Samir Genaim. May-Happen-in-Parallel based Deadlock Analysis for Concurrent Objects. In Dirk Beyer and Michele Boreale, editors, Proceedings of the International Conference on Formal Techniques for Distributed Systems (FMOODS/FORTE'13), volume 7892 of Lecture Notes in Computer Science, pages 273-288. Springer, 2013. [ bibtex | abstract | DOI ]

[11] Pierre Ganty and Samir Genaim. Proving Termination Starting from the End. In Natasha Sharygina and Helmut Veith, editors, Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13), volume 8044 of Lecture Notes in Computer Science, pages 397-412. Springer, 2013. [ bibtex | abstract | DOI | arXiv ]

[12] Amir M. Ben-Amram and Samir Genaim. On the Linear Ranking Problem for Integer Linear-Constraint Loops. In Roberto Giacobazzi and Radhia Cousot, editors, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'13), pages 51-62, 2013. Nominated for CACM Research Highlights http://www.sigplan.org/Newsletters/CACM/Papers. [ bibtex | abstract | DOI ]

[13] Diego Esteban Alonso Blas and Samir Genaim. On the Limits of the Classical Approach to Cost Analysis. In Antoine Miné and David Schmidt, editors, Proceedings of the 19th International Symposium of Static Analysis (SAS'12), volume 7460 of Lecture Notes in Computer Science, pages 405-421. Springer, 2012. [ bibtex | abstract | DOI ]

[14] Elvira Albert, Antonio Flores-Montoya, and Samir Genaim. Analysis of May-Happen-in-Parallel in Concurrent Objects. In Holger Giese and Grigore Rosu, editors, Proceedings of the International Conference on Formal Techniques for Distributed Systems (FMOODS/FORTE'12), volume 7273 of Lecture Notes in Computer Science, pages 35-51. Springer, 2012. [ bibtex | abstract | DOI ]

[15] Elvira Albert, Richard Bubel, Samir Genaim, Reiner Hähnle, and Guillermo Román-Díez. Verified Resource Guarantees for Heap Manipulating Programs. In Juan de Lara and Andrea Zisman, editors, Proceedings of the 15th International Conference on Fundamental Approaches to Software Engineering (FASE'12), volume 7212 of Lecture Notes in Computer Science, pages 130-145. Springer, 2012. [ bibtex | abstract | DOI ]

[16] Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, and Germán Puebla. Automatic Inference of Resource Consumption Bounds. In Nikolaj Bjørner and Andrei Voronkov, editors, Proceedings of the 18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-18), volume 7180 of Lecture Notes in Computer Science, pages 1-11. Springer, 2012. [ bibtex | abstract | DOI ]

[17] Amir M. Ben-Amram, Samir Genaim, and Abu Naser Masud. On the Termination of Integer Loops. In Viktor Kuncak and Andrey Rybalchenko, editors, Proceedings of the 13th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'12), volume 7148 of Lecture Notes in Computer Science, pages 72-87. Springer, 2012. [ bibtex | abstract | DOI ]

[18] Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, and German Puebla. Cost Analysis of Concurrent OO Programs. In Hongseok Yang, editor, Proceedings of the 9th Asian Symposium on Programming Languages and Systems (APLAS'11), volume 7078 of Lecture Notes in Computer Science, pages 238-254. Springer, 2011. [ bibtex | abstract | DOI ]

[19] Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa, Einar Broch Johnsen, Rudolf Schlatte, and Silvia Lizeth Tapia Tarifa. Simulating Concurrent Behaviors with Worst-Case Cost Bounds. In Michael Butler and Wolfram Schulte, editors, Proceedings of the 17th International Symposium on Formal Methods (FM'11), volume 6664 of Lecture Notes in Computer Science, pages 353-368. Springer, 2011. [ bibtex | abstract | DOI ]

[20] Elvira Albert, Puri Arenas, Samir Genaim, and Damiano Zanardini. Task-Level Analysis for a Language with Async-Finish Parallelism. In Jan Vitek and Bjorn De Sutter, editors, Proceedings of the ACM SIGPLAN/SIGBED 2011 conference on Languages, compilers, and tools for embedded systems (LCTES'11), pages 21-30. ACM, 2011. [ bibtex | abstract | DOI ]

[21] Elvira Albert, Samir Genaim, and Abu Naser Masud. More Precise yet Widely Applicable Cost Analysis. In Ranjit Jhala and David A. Schmidt, editors, Proceedings of the 12th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'11), volume 6538 of Lecture Notes in Computer Science, pages 38-53. Springer, 2011. [ bibtex | abstract | DOI ]

[22] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Diana Ramírez. From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis. In Radhia Cousot and Matthieu Martel, editors, Proceedings of the 17th International Symposium on Static Analysis (SAS'10), volume 6337 of Lecture Notes in Computer Science, pages 100-116. Springer, 2010. [ bibtex | abstract | DOI ]

[23] Elvira Albert, Samir Genaim, and Miguel Gómez-Zamalloa. Parametric Inference of Memory Requirements for Garbage Collected Languages. In Jan Vitek and Doug Lea, editors, Proceedings of the 2010 International Symposium on Memory Management (ISMM'10), pages 121-130. ACM, 2010. [ bibtex | abstract | DOI ]

[24] Michael Codish, Samir Genaim, and Peter J. Stuckey. A Declarative Encoding of Telecommunications Feature Subscription in SAT. In António Porto and Francisco Javier López-Fraguas, editors, Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'09), pages 255-266. ACM, 2009. [ bibtex | abstract | DOI ]

[25] Elvira Albert, Puri Arenas, Samir Genaim, Israel Herraiz, and Germán Puebla. Comparing Cost Functions in Resource Analysis. In Marko C. J. D. van Eekelen and Olha Shkaravska, editors, Proceedings of the 1st International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA'09), volume 6324 of Lecture Notes in Computer Science, pages 1-17. Springer, 2009. [ bibtex | abstract | DOI ]

[26] Elvira Albert, Diego Alonso, Puri Arenas, Samir Genaim, and Germán Puebla. Asymptotic Resource Usage Bounds. In Zhenjiang Hu, editor, Proceedings of the 7th Asian Symposium on Programming Languages and Systems (APLAS'09), volume 5904 of Lecture Notes in Computer Science, pages 294-310. Springer, 2009. [ bibtex | abstract | DOI ]

[27] Elvira Albert, Puri Arenas, Samir Genaim, and Germán Puebla. Field-Sensitive Value Analysis by Field-Insensitive Analysis. In Ana Cavalcanti and Dennis Dams, editors, Proceedings of the 16th International Symposium on Formal Methods (FM'09), volume 5850 of Lecture Notes in Computer Science, pages 370-386. Springer, 2009. [ bibtex | abstract | DOI ]

[28] Elvira Albert, Samir Genaim, and Miguel Gómez-Zamalloa. Live Heap Space Analysis for Languages with Garbage Collection. In Hillel Kolodner and Guy L. Steele Jr., editors, Proceedings of the 8th International Symposium on Memory Management (ISMM'09), pages 129-138. ACM, 2009. [ bibtex | abstract | DOI ]

[29] Elvira Albert, Puri Arenas, Samir Genaim, and Germán Puebla. Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. In María Alpuente and Germán Vidal, editors, Proceedings of the 15th International Symposium on Static Analysis (SAS'08), volume 5079 of Lecture Notes in Computer Science, pages 221-237. Springer, 2008. [ bibtex | abstract | DOI ]

[30] Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, and Damiano Zanardini. Termination Analysis of Java Bytecode. In Gilles Barthe and Frank S. de Boer, editors, Proceedings of the 10th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS'08), volume 5051 of Lecture Notes in Computer Science, pages 2-18. Springer, 2008. [ bibtex | abstract | DOI ]

[31] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Damiano Zanardini. Removing Useless Variables in Cost Analysis of Java Bytecode. In Roger L. Wainwright and Hisham Haddad, editors, Proceedings of the 2008 ACM Symposium on Applied Computing (SAC'08), pages 368-375. ACM, 2008. [ bibtex | abstract | DOI ]

[32] Elvira Albert, Samir Genaim, and Miguel Gómez-Zamalloa. Heap Space Analysis for Java Bytecode. In Greg Morrisett and Mooly Sagiv, editors, Proceedings of the 6th International Symposium on Memory management (ISMM'07), pages 105-116. ACM, 2007. [ bibtex | abstract | DOI ]

[33] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Damiano Zanardini. Cost Analysis of Java Bytecode. In Rocco De Nicola, editor, Proceedings of the 16th European Symposium on Programming (ESOP'07), volume 4421 of Lecture Notes in Computer Science, pages 157-172. Springer-Verlag, 2007. [ bibtex | abstract | DOI ]

[34] Andy King, Lunjin Lu, and Samir Genaim. Detecting Determinacy in Prolog Programs. In Sandro Etalle and Miroslaw Truszczynski, editors, Proceedings of the 22nd International Conference on Logic Programming (ICLP'06), volume 4079 of Lecture Notes in Computer Science, pages 132-147. Springer-Verlag, 2006. [ bibtex | abstract | DOI ]

[35] Samir Genaim and Fausto Spoto. Information Flow Analysis for Java Bytecode. In Radhia Cousot, editor, Proceedings of the 6th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'05), volume 3385 of Lecture Notes in Computer Science, pages 346-362. Springer-Verlag, 2005. [ bibtex | abstract | DOI ]

[36] Samir Genaim and Andy King. Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. In Pierpaolo Degano, editor, Proceedings of the 12th European Symposium on Programming (ESOP'03), volume 2618 of Lecture Notes in Computer Science, pages 84-98. Springer-Verlag, 2003. [ bibtex | abstract | DOI ]

[37] Maurice Bruynooghe, Michael Codish, Samir Genaim, and Wim Vanhoof. Reuse of Results in Termination Analysis of Typed Logic Programs. In Manuel V. Hermenegildo and Germán Puebla, editors, Proceedings of the 9th International Symposium on Static Analysis (SAS'02), volume 2477 of Lecture Notes in Computer Science, pages 477-492. Springer-Verlag, 2002. [ bibtex | abstract | DOI ]

[38] Samir Genaim, Michael Codish, John P. Gallagher, and Vitaly Lagoon. Combining Norms to Prove Termination. In Agostino Cortesi, editor, Proceedings of the 3rd International Workshop on Verification, Model Checking, and Abstract Interpretation (VMCAI'02), volume 2294 of Lecture Notes in Computer Science, pages 126-138. Springer-Verlag, 2002. [ bibtex | abstract | DOI ]

[39] Samir Genaim and Michael Codish. The Def-inite Approach to Dependency Analysis. In David Sands, editor, Proceedings of the 10th European Symposium on Programming (ESOP'01), volume 2028 of Lecture Notes in Computer Science, pages 417-432. Springer-Verlag, 2001. [ bibtex | abstract | DOI ]

[40] Michael Codish, Samir Genaim, Harald Søndergaard, and Peter J. Stuckey. Higher-Precision Groundness Analysis. In Philippe Codognet, editor, Proceedings of the 17th International Conference Logic Programming (ICLP'01), volume 2237 of Lecture Notes in Computer Science, pages 135-149. Springer-Verlag, 2001. [ bibtex | abstract | DOI ]

[41] Samir Genaim and Michael Codish. Inferring Termination Conditions for Logic Programs Using Backwards Analysis. In Robert Nieuwenhuis and Andrei Voronkov, editors, Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'01), volume 2250 of Lecture Notes in Computer Science, pages 685-694. Springer-Verlag, 2001. [ bibtex | abstract | DOI ]

[42] Samir Genaim and Michael Codish. Incremental Refinement of Semantic Based Program Analysis for Logic Programs. In Jenny. Edwards, editor, Proceedings of the 22nd Australasian Computer Science Conference (ACSC'99), volume 21 of Australian Computer Science Communications, pages 348-359. Singapore ; New York : Springer, 1999. [ bibtex | abstract | DOI | .ps ]

Book Chapters

[1] Elvira Albert, Diego Esteban Alonso Blas, Puri Arenas, Jesús Correas, Antonio Flores-Montoya, Samir Genaim, Miguel Gómez-Zamalloa, Abu Naser Masud, Germán Puebla, José Miguel Rojas, Guillermo Román-Díez, and Damiano Zanardini. Automatic Inference of Bounds on Resource Consumption. In HATS International School on Formal Models for Objects and Components 2012. Tutorial Lectures, volume 7866 of Lecture Notes in Computer Science, pages 119-144. Springer, 2013. [ bibtex | abstract | DOI ]

[2] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Damiano Zanardini. Resource Usage Analysis and its Application to Resource Certification. In Alessandro Aldini, Gilles Barthe, and Roberto Gorrieri, editors, Foundations of Security Analysis and Design V, FOSAD 2007/2008/2009 Tutorial Lectures, volume 5705 of Lecture Notes in Computer Science, pages 258-288. Springer, 2009. [ bibtex | abstract | DOI ]

[3] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Damiano Zanardini. COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode. In Proceedings of the 6th International Symposium on Formal Methods for Components and Objects (FMCO'07), volume 5382 of Lecture Notes in Computer Science, pages 113-132. Springer, 2008. [ bibtex | abstract | DOI ]

Workshop and National Conference Publications

[1] Elvira Albert, Antonio Flores-Montoya, and Samir Genaim. May-Happen-in-Parallel Analysis with Condition Synchronization. In Foundational and Practical Aspects of Resource Analysis (FOPARA 2015), 2015. [ bibtex | abstract ]

[2] Elvira Albert, Samir Genaim, and Guillermo Román-Díez. Conditional Termination of Loops over Arrays. In The 7th Workshop on Bytecode Semantics, Verification, Analysis and Transformation (Bytecode'12), 2012. [ bibtex | abstract ]

[3] Diego Alonso, Puri Arenas, and Samir Genaim. Handling non-Linear Operations in the Value Analysis of COSTA. Electr. Notes Theor. Comput. Sci., 279(1):3-17, 2011. Presented at Bytecode'10. [ bibtex | abstract | DOI ]

[4] Samir Genaim and Damiano Zanardini. The Acyclicity Inference of COSTA. In The 11th International Workshop on Termination, 2010. [ bibtex | abstract ]

[5] Elvira Albert, Puri Arenas, Samir Genaim, and Germán Puebla. Cost Relation Systems: A Language-Independent Target Language for Cost Analysis. Electr. Notes Theor. Comput. Sci., 248:31-46, 2009. Presented at PROLE'08. [ bibtex | abstract | DOI ]

[6] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Diana Ramírez, and Damiano Zanardini. Upper Bounds of Resource Usage for Java Bytecode using COSTA and its Web Interface. In Workshop on Resource Analysis, 9th September 2008 University of Hertfordshire, Hatfield, UK, 2008. [ bibtex | abstract ]

[7] Samir Genaim and Fausto Spoto. Constancy Analysis. In The 10th Workshop on Formal Techniques for Java-like Programs (FTfJP'08), 2008. [ bibtex | abstract ]

[8] Elvira Albert, Puri Arenas, Samir Genaim, and Germán Puebla. Dealing with Numeric Fields in Termination Analysis of Java-like Languages. In The 10th Workshop on Formal Techniques for Java-like Programs (FTfJP'08), 2008. [ bibtex | abstract ]

[9] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Damiano Zanardini. COSTA: A Cost and Termination Analyzer for Java Bytecode. In The 3rd Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE'08), Budapest, Hungary, 2008. [ bibtex | abstract ]

[10] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Damiano Zanardini. Applications of Static Slicing in Cost Analysis of Java Bytecode. In The 3rd International Workshop on Programming Language Interference and Dependence (PLID'07), 2007. [ bibtex | abstract ]

[11] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Damiano Zanardini. A Generic Framework for the Cost Analysis of Java Bytecode. In Pimentel Ernesto, editor, Proceedings of the 2007 Spanish Conference on Programming and Computer Languages (PROLE'07), pages 61-70, 2007. [ bibtex | abstract ]

[12] Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, and Damiano Zanardini. Termination Analysis of Java Bytecode. In Alexander Serebrenik and Dieter Hofbauer, editors, The 9th International Workshop on Termination (WST'07), 2007. [ bibtex | abstract ]

[13] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, and Damiano Zanardini. Experiments in Cost Analysis of Java Bytecode. Electr. Notes Theor. Comput. Sci., 190(1):67-83, 2007. Presented at BYTECODE'07. [ bibtex | abstract | DOI ]

[14] Samir Genaim and Fausto Spoto. Information Flow Analysis for Java Bytecode. In Roberto Giacobazzi, editor, The 1st International Workshop on Programming Language Interference and Dependence (PLID'04), 2004. [ bibtex | abstract ]

[15] Samir Genaim, Roberto Giacobazzi, and Isabela Mastroeni. Modeling Secure Information Flow with Boolean Functions. In IFIP WG 1.7, ACM SIGPLAN and GI FoMSESS Workshop on Issues in the Theory of Security (WITS'04), pages 55-66, 2004. [ bibtex | abstract ]

[16] Michael Codish and Samir Genaim. Proving Termination One Loop at a Time. In Frédéric Mesnard and Alexander Serebrenik, editors, Proceedings of the 13th International Workshop on Logic Programming Environments (WLPE'03), Technical Report CW371, pages 48-59. Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B-3001 Heverlee (Belgium), 2003. [ bibtex | abstract ]

[17] Michael Codish, Samir Genaim, Maurice Bruynooghe, John P. Gallagher, and Wim Vanhoof. One Loop at a Time. In Albert Rubio, editor, Proceedings of the 6th International Workshop on Termination (WST'03), Technical Report DSIC-II/15/03, pages 1-4. Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, 2003. [ bibtex | abstract ]

[18] Samir Genaim and Michael Codish. Inferring Termination Conditions for Logic Programs using Backwards Analysis. In Proceedings of APPIA-GULP-PRODE'01 Joint Conference on Declarative Programming (AGP'01), 2001. [ bibtex | abstract ]

[19] Muhammad Abozaed, Samir Genaim, and Michael Codish. Optimized Eager Evaluation of Fixed Points for the Analysis of Logic Programs. In Workshop on Fixed Points in Computer Science (FICS'01), 2001. [ bibtex | abstract ]

[20] Carmel Domshlak, Samir Genaim, and Ronen Brafman. Preference-based Configuration of Web Page Content. In The 3rd Workshop on Configuration (ECAI'2000), pages 19-22, 2000. [ bibtex | abstract ]

[21] Samir Genaim and Michael Codish. The Def-inite Approach to Dependency Analysis. In Proceedings of APPIA-GULP-PRODE'00 Joint Conference on Declarative Programming (AGP'00), 2000. [ bibtex | abstract ]

Tool Papers

[1] Jesús Doménech, Samir Genaim, Einar Broch Johnsen, and Rudolf Schlatte. EasyInterface: A Toolkit for Rapid Development of GUIs for Research Prototype Tools. In Marieke Huisman and Julia Rubin, editors, 20th International Conference on Fundamental Approaches to Software Engineering (FASE'16), pages 379-383, 2017. [ bibtex | abstract | DOI ]

[2] Elvira Albert, Puri Arenas, Antonio Flores-Montoya, Samir Genaim, Miguel Gómez-Zamalloa, Enrique Martin-Martin, Germán Puebla, and Guillermo Román-Díez. SACO: Static Analyzer for Concurrent Objects. In Erika Ábrahám and Klaus Havelund, editors, Proceedings of the 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'14), volume 8413 of Lecture Notes in Computer Sience, pages 562-567. Springer, 2014. [ bibtex | abstract | DOI ]

[3] Elvira Albert, Antonio Flores-Montoya, and Samir Genaim. MayPar: A May-Happen-in-Parallel Analyzer for Concurrent Objects. In Will Tracz, Martin P. Robillard, and Tevfik Bultan, editors, Proceedings of the 20th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-20), pages 14:1-14:5. ACM, 2012. [ bibtex | abstract | DOI ]

[4] Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, and Germán Puebla. COSTABS: A Cost and Termination Analyzer for ABS. In Oleg Kiselyov and Simon Thompson, editors, Proceedings of the ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation (PEPM'12), pages 151-154. ACM, 2012. [ bibtex | abstract | DOI ]

[5] Elvira Albert, Richard Bubel, Samir Genaim, Reiner Hähnle, Germán Puebla, and Guillermo Román-Díez. Verified Resource Guarantees using COSTA and KeY. In Siau-Cheng Khoo and Jeremy G. Siek, editors, Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM'11), SIGPLAN, pages 73-76. ACM, 2011. [ bibtex | abstract | DOI ]

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

[7] Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Diana Ramírez, and Damiano Zanardini. The COSTA Cost and Termination Analyzer for Java Bytecode and its Web Interface (Tool Demo). In The 22nd European Conference on Object-Oriented Programming (ECOOP'08), 2008. [ bibtex | abstract ]

Edited Proceedings

[1] Elvira Albert and Samir Genaim, editors. Proceedings of the Workshop on Bytecode Semantics, Verification, Analysis and Transformation, Electronic Notes in Theoretical Computer Science. Elsevier - North Holland, 2009. [ bibtex | abstract | DOI ]

Technical Reports

Thesis

[1] Samir Genaim. Semantic Based WorkBench For Termination Analysis of Logic Programs. PhD thesis, Department of Computer Science, Ben-Gurion University of the Negev, 2003. [ bibtex | abstract ]