Publicaciones (89) Publicaciones de SAMIR GENAIM

2023

  1. Formally Verified EVM Block-Optimizations

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2022

  1. When COSTA Met KeY: Verified Cost Bounds

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer Science and Business Media Deutschland GmbH), pp. 19-37

2021

  1. Lower-Bound Synthesis Using Loop Specialization and Max-SMT

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. Termination analysis of programs with multiphase control-flow

    Electronic Proceedings in Theoretical Computer Science, EPTCS

2019

  1. A Transformational Approach to Resource Analysis with Typed-norms Inference

    Theory and Practice of Logic Programming

  2. Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis

    Theory and Practice of Logic Programming, Vol. 19, Núm. 5-6, pp. 990-1005

  3. Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2017

  1. EASYINTERFACE: A toolkit for rapid development of GUIs for research prototype tools

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  2. May-happen-in-parallel analysis with returned futures

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. On multiphase-linear ranking functions

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  4. Rely-Guarantee Termination and Cost Analyses of Loops with Concurrent Interleavings

    Journal of Automated Reasoning, Vol. 59, Núm. 1, pp. 47-85

2016

  1. A formal verification framework for static analysis: As well as its instantiation to the resource analyzer COSTA and formal verification tool KeY

    Software and Systems Modeling, Vol. 15, Núm. 4, pp. 987-1012

  2. May-happen-in-parallel analysis with condition synchronization

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2015

  1. A practical comparator of cost functions and its applications

    Science of Computer Programming, Vol. 111, Núm. P3, pp. 483-504

  2. Complexity of Bradley-Manna-Sipma lexicographic ranking functions

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. From non-zenoness verification to termination

    2015 ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2015

  4. May-happen-in-parallel analysis for actor-based concurrency

    ACM Transactions on Computational Logic, Vol. 17, Núm. 2

  5. May-happen-in-parallel analysis for asynchronous programs with inter-procedural synchronization

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  6. Object-sensitive cost analysis for concurrent objects

    Software Testing Verification and Reliability, Vol. 25, Núm. 3, pp. 218-271

  7. Preparing HPC applications for Exascale: challenges and recommendations

    Proceedings - 2015 18th International Conference on Network-Based Information Systems, NBiS 2015