default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamir Genaim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2020
[j20]Elvira Albert, Samir Genaim
, Raúl Gutiérrez, Enrique Martin-Martin:
A Transformational Approach to Resource Analysis with Typed-norms Inference. Theory Pract. Log. Program. 20(3): 310-357 (2020)- 2019
- [j19]Jesús J. Doménech, John P. Gallagher, Samir Genaim:
Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis. Theory Pract. Log. Program. 19(5-6): 990-1005 (2019) - 2017
- [j18]Elvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin:
Rely-Guarantee Termination and Cost Analyses of Loops with Concurrent Interleavings. J. Autom. Reason. 59(1): 47-85 (2017) - 2016
- [j17]Elvira Albert, Richard Bubel, Samir Genaim, Reiner Hähnle, Germán Puebla, 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. Softw. Syst. Model. 15(4): 987-1012 (2016) - [j16]Elvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin:
May-Happen-in-Parallel Analysis for Actor-Based Concurrency. ACM Trans. Comput. Log. 17(2): 11 (2016) - 2015
- [j15]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla:
A practical comparator of cost functions and its applications. Sci. Comput. Program. 111: 483-504 (2015) - [j14]Elvira Albert, Puri Arenas, Jesús Correas Fernández, Samir Genaim, Miguel Gómez-Zamalloa, Germán Puebla, Guillermo Román-Díez:
Object-sensitive cost analysis for concurrent objects. Softw. Test. Verification Reliab. 25(3): 218-271 (2015) - 2014
- [j13]Amir M. Ben-Amram, Samir Genaim:
Ranking Functions for Linear-Constraint Loops. J. ACM 61(4): 26:1-26:55 (2014) - [j12]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Guillermo Román-Díez:
Conditional termination of loops over heap-allocated data. Sci. Comput. Program. 92: 2-24 (2014) - [j11]Damiano Zanardini, Samir Genaim:
Inference of Field-Sensitive Reachability and Cyclicity. ACM Trans. Comput. Log. 15(4): 33:1-33:41 (2014) - 2013
- [j10]Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa:
Heap space analysis for garbage collected languages. Sci. Comput. Program. 78(9): 1427-1448 (2013) - [j9]Samir Genaim, Damiano Zanardini:
Reachability-based acyclicity analysis by Abstract Interpretation. Theor. Comput. Sci. 474: 60-79 (2013) - [j8]Elvira Albert, Samir Genaim, Abu Naser Masud:
On the Inference of Resource Usage Upper and Lower Bounds. ACM Trans. Comput. Log. 14(3): 22:1-22:35 (2013) - 2012
- [j7]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) - [j6]Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud:
On the Termination of Integer Loops. ACM Trans. Program. Lang. Syst. 34(4): 16:1-16:24 (2012) - 2011
- [j5]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla:
Closed-Form Upper Bounds in Static Cost Analysis. J. Autom. Reason. 46(2): 161-203 (2011) - 2008
- [j4]Samir Genaim, Andy King:
Inferring non-suspension conditions for logic programs with dynamic scheduling. ACM Trans. Comput. Log. 9(3): 17:1-17:43 (2008) - 2007
- [j3]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): 10 (2007) - 2005
- [j2]Samir Genaim, Michael Codish:
Inferring Termination Conditions for Logic Programs using Backwards Analysis. Theory Pract. Log. Program. 5(1-2): 75-91 (2005) - 2001
- [j1]Samir Genaim, Jacob M. Howe, Michael Codish:
Worst-case groundness analysis using definite boolean functions. Theory Pract. Log. Program. 1(5): 611-615 (2001)
Conference and Workshop Papers
- 2023
- [c64]Elvira Albert, Samir Genaim, Daniel Kirchner, Enrique Martin-Martin:
Formally Verified EVM Block-Optimizations. CAV (3) 2023: 176-189 - 2022
- [c63]Elvira Albert, Samir Genaim, Alicia Merayo, Guillermo Román-Díez:
When COSTA Met KeY: Verified Cost Bounds. The Logic of Software. A Tasting Menu of Formal Methods 2022: 19-37 - 2021
- [c62]Elvira Albert, Samir Genaim, Enrique Martin-Martin, Alicia Merayo, Albert Rubio:
Lower-Bound Synthesis Using Loop Specialization and Max-SMT. CAV (2) 2021: 863-886 - [c61]Jesús J. Doménech, Samir Genaim:
Termination Analysis of Programs with Multiphase Control-Flow. HCVS@ETAPS 2021: 13-21 - 2019
- [c60]Amir M. Ben-Amram, Jesús J. Doménech, Samir Genaim:
Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets. SAS 2019: 459-480 - 2017
- [c59]Elvira Albert, Samir Genaim, Pablo Gordillo:
May-Happen-in-Parallel Analysis with Returned Futures. ATVA 2017: 42-58 - [c58]Amir M. Ben-Amram, Samir Genaim:
On Multiphase-Linear Ranking Functions. CAV (2) 2017: 601-620 - [c57]Jesús Doménech, Samir Genaim, Einar Broch Johnsen, Rudolf Schlatte:
EasyInterface: A Toolkit for Rapid Development of GUIs for Research Prototype Tools. FASE 2017: 379-383 - 2015
- [c56]Amir M. Ben-Amram, Samir Genaim:
Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions. CAV (2) 2015: 304-321 - [c55]Elvira Albert, Puri Arenas, Jesús Correas, Samir Genaim, Miguel Gómez-Zamalloa, Enrique Martin-Martin, Germán Puebla, Guillermo Román-Díez:
Resource Analysis: From Sequential to Concurrent and Distributed Programs. FM 2015: 3-17 - [c54]Elvira Albert, Antonio Flores-Montoya, Samir Genaim:
May-Happen-in-Parallel Analysis with Condition Synchronization. FOPARA 2015: 1-19 - [c53]Pierre Ganty, Samir Genaim, Ratan Lal, Pavithra Prabhakar:
From non-zenoness verification to termination. MEMOCODE 2015: 228-237 - [c52]Erika Ábrahám, Costas Bekas, Ivona Brandic, Samir Genaim, Einar Broch Johnsen, Ivan Kondov, Sabri Pllana, Achim Streit:
Preparing HPC Applications for Exascale: Challenges and Recommendations. NBiS 2015: 401-406 - [c51]Elvira Albert, Samir Genaim, Pablo Gordillo:
May-Happen-in-Parallel Analysis for Asynchronous Programs with Inter-Procedural Synchronization. SAS 2015: 72-89 - 2014
- [c50]Elvira Albert, Puri Arenas, Antonio Flores-Montoya, Samir Genaim, Miguel Gómez-Zamalloa, Enrique Martin-Martin, German Puebla, Guillermo Román-Díez:
SACO: Static Analyzer for Concurrent Objects. TACAS 2014: 562-567 - 2013
- [c49]Diego Esteban Alonso-Blas, Puri Arenas, Samir Genaim:
Precise Cost Analysis via Local Reasoning. ATVA 2013: 319-333 - [c48]Elvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin:
Termination and Cost Analysis of Loops with Concurrent Interleavings. ATVA 2013: 349-364 - [c47]Pierre Ganty, Samir Genaim:
Proving Termination Starting from the End. CAV 2013: 397-412 - [c46]Antonio Flores-Montoya, Elvira Albert, Samir Genaim:
May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects. FMOODS/FORTE 2013: 273-288 - [c45]Elvira Albert, Samir Genaim, Raúl Gutiérrez:
A Transformational Approach to Resource Analysis with Typed-Norms. LOPSTR 2013: 38-53 - [c44]Elvira Albert, Samir Genaim, Enrique Martin-Martin:
May-Happen-in-Parallel Analysis for Priority-Based Scheduling. LPAR 2013: 18-34 - [c43]Amir M. Ben-Amram, Samir Genaim:
On the linear ranking problem for integer linear-constraint loops. POPL 2013: 51-62 - 2012
- [c42]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 - [c41]Elvira Albert, Diego Esteban Alonso-Blas, Puri Arenas, Jesús Correas, Antonio Flores-Montoya, Samir Genaim, Miguel Gómez-Zamalloa, Abu Naser Masud, German Puebla, José Miguel Rojas, Guillermo Román-Díez, Damiano Zanardini:
Automatic Inference of Bounds on Resource Consumption. FMCO 2012: 119-144 - [c40]Elvira Albert, Antonio Flores-Montoya, Samir Genaim:
Analysis of May-Happen-in-Parallel in Concurrent Objects. FMOODS/FORTE 2012: 35-51 - [c39]Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, Germán Puebla:
Automatic Inference of Resource Consumption Bounds. LPAR 2012: 1-11 - [c38]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 - [c37]Diego Esteban Alonso-Blas, Samir Genaim:
On the Limits of the Classical Approach to Cost Analysis. SAS 2012: 405-421 - [c36]Elvira Albert, Antonio Flores-Montoya, Samir Genaim:
MayPar: a may-happen-in-parallel analyzer for concurrent objects. SIGSOFT FSE 2012: 14 - [c35]Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud:
On the Termination of Integer Loops. VMCAI 2012: 72-87 - 2011
- [c34]Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, German Puebla:
Cost Analysis of Concurrent OO Programs. APLAS 2011: 238-254 - [c33]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 - [c32]Elvira Albert, Puri Arenas, Samir Genaim, Damiano Zanardini:
Task-level analysis for a language with async/finish parallelism. LCTES 2011: 21-30 - [c31]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 - [c30]Elvira Albert, Samir Genaim, Abu Naser Masud:
More Precise Yet Widely Applicable Cost Analysis. VMCAI 2011: 38-53 - [c29]Diego Esteban Alonso-Blas, Puri Arenas, Samir Genaim:
Handling Non-linear Operations in the Value Analysis of COSTA. Bytecode@ETAPS 2011: 3-17 - 2010
- [c28]Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa:
Parametric inference of memory requirements for garbage collected languages. ISMM 2010: 121-130 - [c27]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 - 2009
- [c26]Elvira Albert, Diego Esteban Alonso-Blas, Puri Arenas, Samir Genaim, German Puebla:
Asymptotic Resource Usage Bounds. APLAS 2009: 294-310 - [c25]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla:
Field-Sensitive Value Analysis by Field-Insensitive Analysis. FM 2009: 370-386 - [c24]Elvira Albert, Puri Arenas, Samir Genaim, Israel Herraiz, German Puebla:
Comparing Cost Functions in Resource Analysis. FOPARA 2009: 1-17 - [c23]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini:
Resource Usage Analysis and Its Application to Resource Certification. FOSAD 2009: 258-288 - [c22]Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa:
Live heap space analysis for languages with garbage collection. ISMM 2009: 129-138 - [c21]Michael Codish, Samir Genaim, Peter J. Stuckey:
A declarative encoding of telecommunications feature subscription in SAT. PPDP 2009: 255-266 - [c20]Elvira Albert, Samir Genaim:
Preface. BYTECODE@ETAPS 2009: 1-2 - [c19]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. PROLE 2009: 109-121 - 2008
- [c18]Elvira Albert, Puri Arenas, Michael Codish, Samir Genaim, Germán Puebla, Damiano Zanardini:
Termination Analysis of Java Bytecode. FMOODS 2008: 2-18 - [c17]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini:
Removing useless variables in cost analysis of Java bytecode. SAC 2008: 368-375 - [c16]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla:
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis. SAS 2008: 221-237 - [c15]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla:
Cost Relation Systems: A Language-Independent Target Language for Cost Analysis. PROLE 2008: 31-46 - 2007
- [c14]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini:
Cost Analysis of Java Bytecode. ESOP 2007: 157-172 - [c13]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 - [c12]Elvira Albert, Samir Genaim, Miguel Gómez-Zamalloa:
Heap space analysis for java bytecode. ISMM 2007: 105-116 - [c11]Elvira Albert, Puri Arenas, Samir Genaim, Germán Puebla, Damiano Zanardini:
Experiments in Cost Analysis of Java Bytecode. Bytecode@ETAPS 2007: 67-83 - 2006
- [c10]Andy King, Lunjin Lu, Samir Genaim:
Detecting Determinacy in Prolog Programs. ICLP 2006: 132-147 - 2005
- [c9]Samir Genaim, Fausto Spoto:
Information Flow Analysis for Java Bytecode. VMCAI 2005: 346-362 - 2003
- [c8]Samir Genaim, Andy King:
Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. ESOP 2003: 84-98 - [c7]Michael Codish, Samir Genaim:
Proving Termination One Loop at a Time. WLPE 2003: 48-59 - 2002
- [c6]Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof:
Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002: 477-492 - [c5]Samir Genaim, Michael Codish, John P. Gallagher, Vitaly Lagoon:
Combining Norms to Prove Termination. VMCAI 2002: 126-138 - 2001
- [c4]Samir Genaim, Michael Codish:
Inferring termination conditions for logic programs using backwards analysis. APPIA-GULP-PRODE 2001: 229-243 - [c3]Samir Genaim, Michael Codish:
The Def-inite Approach to Dependency Analysis. ESOP 2001: 417-432 - [c2]Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey:
Higher-Precision Groundness Analysis. ICLP 2001: 135-149 - [c1]Samir Genaim, Michael Codish:
Inferring Termination Conditions for Logic Programs Using Backwards Analysis. LPAR 2001: 685-694
Editorship
- 2009
- [e1]Elvira Albert, Samir Genaim:
Proceedings of the Fourth Workshop on Bytecode Semantics, Verification, Analysis and Transformation, BYTECODE@ETAPS 2009, York, UK, March 29, 2009. Electronic Notes in Theoretical Computer Science 253(5), Elsevier 2009 [contents]
Data and Artifacts
- 2023
- [d3]Elvira Albert, Samir Genaim, Daniel Kirchner, Enrique Martin-Martin:
Artifact of the Paper "Formally Verified EVM Block-Optimizations". Zenodo, 2023
- [d2]Elvira Albert, Samir Genaim, Daniel Kirchner, Enrique Martin-Martin:
Artifact of the Paper "Formally Verified EVM Block-Optimizations". Zenodo, 2023 - 2022
- [d1]Elvira Albert, Samir Genaim, Daniel Kirchner, Enrique Martin-Martin:
Artifact of the Paper "Formally Verified EVM Block-Optimizations". Zenodo, 2022
Informal and Other Publications
- 2019
- [i13]Jesús J. Doménech, John P. Gallagher, Samir Genaim:
Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis. CoRR abs/1907.12345 (2019) - [i12]Elvira Albert, Samir Genaim, Raúl Gutiérrez, Enrique Martin-Martin:
A Transformational Approach to Resource Analysis with Typed-norms Inference. CoRR abs/1908.02078 (2019) - 2018
- [i11]Amir M. Ben-Amram, Jesús Doménech, Samir Genaim:
Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets. CoRR abs/1811.07340 (2018) - 2017
- [i10]Jesús Doménech, Samir Genaim, Einar Broch Johnsen, Rudolf Schlatte:
EasyInterface: A toolkit for rapid development of GUIs for research prototype tools. CoRR abs/1702.00364 (2017) - [i9]Amir M. Ben-Amram, Samir Genaim:
On Multiphase-Linear Ranking Functions. CoRR abs/1703.07547 (2017) - 2015
- [i8]Erika Ábrahám, Costas Bekas, Ivona Brandic, Samir Genaim, Einar Broch Johnsen, Ivan Kondov, Sabri Pllana, Achim Streit:
Preparing HPC Applications for Exascale: Challenges and Recommendations. CoRR abs/1503.06974 (2015) - [i7]Amir M. Ben-Amram, Samir Genaim:
Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions. CoRR abs/1504.05018 (2015) - 2013
- [i6]Pierre Ganty, Samir Genaim:
Proving Termination Starting from the End. CoRR abs/1302.4539 (2013) - [i5]Damiano Zanardini, Samir Genaim:
Inference of Field-Dependent Cyclicity. CoRR abs/1306.6526 (2013) - [i4]Samir Genaim, Damiano Zanardini:
Corrigendum to "Reachability-based acyclicity analysis by abstract interpretation" [Theoretical Computer Science 474 (2013) 60-79]. Theor. Comput. Sci. 503: 115 (2013) - 2012
- [i3]Samir Genaim, Damiano Zanardini:
Reachability-based Acyclicity Analysis by Abstract Interpretation. CoRR abs/1206.2188 (2012) - [i2]Amir M. Ben-Amram, Samir Genaim:
On the Linear Ranking Problem for Integer Linear-Constraint Loops. CoRR abs/1208.4041 (2012) - 2003
- [i1]Samir Genaim, Michael Codish:
Inferring Termination Conditions for Logic Programs using Backwards Analysis. CoRR cs.PL/0312023 (2003)
Coauthor Index
[j20] [j18] [j17] [j16] [j15] [j14] [j12] [j10] [j8] [j7] [j5] [c64] [c63] [c62] [c59] [c55] [c54] [c51] [c50] [c48] [c46] [c45] [c44] [c42] [c41] [c40] [c39] [c38] [c36] [c34] [c33] [c32] [c31] [c30] [c28] [c27] [c26] [c25] [c24] [c23] [c22] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [c13] [c12] [c11] [e1] [d3] [d2] [d1] [i12]
Germán Puebla
aka: German Puebla
aka: German Puebla
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
