Publicaciones en las que colabora con ELVIRA MARÍA ALBERT ALBIOL (53)

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)

2019

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

    Theory and Practice of Logic Programming

2017

  1. 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)

  2. 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. May-happen-in-parallel analysis for actor-based concurrency

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

  3. 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)

  4. Object-sensitive cost analysis for concurrent objects

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

  5. Resource analysis: From sequential to concurrent and distributed programs

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

2014

  1. A transformational approach to resource analysis with typed-norms

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

  2. Conditional termination of loops over heap-allocated data

    Science of Computer Programming, Vol. 92, Núm. PART A, pp. 2-24

  3. SACO: Static analyzer for concurrent objects

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

2013

  1. Automatic inference of bounds on resource consumption

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

  2. Heap space analysis for garbage collected languages

    Science of Computer Programming, Vol. 78, Núm. 9, pp. 1427-1448

  3. May-happen-in-parallel analysis for priority-based scheduling

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

  4. May-happen-in-parallel based deadlock analysis for concurrent objects

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