Publicaciones en colaboración con investigadores/as de Universitat Politècnica de Catalunya (53)

2023

  1. Circom: A Circuit Description Language for Building Zero-Knowledge Applications

    IEEE Transactions on Dependable and Secure Computing, Vol. 20, Núm. 6, pp. 4733-4751

2019

  1. The Termination and Complexity Competition

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

2018

  1. Constrained dynamic partial order reduction

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

  2. EthIR: A Framework for High-Level Analysis of Ethereum Bytecode

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

  3. SDN-Actors: Modeling and verification of SDN programs

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

2017

  1. Proving termination through conditional termination

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

2016

  1. Speeding up the constraint-based method in difference logic

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

2015

  1. Compositional safety verification with Max-SMT

    Proceedings of the 15th Conference on Formal Methods in Computer-Aided Design, FMCAD 2015

  2. Normal higher-order termination

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

  3. Termination competition (TermCOMP 2015)

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

  4. The computability path ordering

    Logical Methods in Computer Science, Vol. 11, Núm. 4

2014

  1. Minimal-model-guided approaches to solving polynomial constraints and extensions

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

  2. Proving non-termination using max-SMT

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

2013

  1. Paramodulation with non-monotonic orderings and simplification

    Journal of Automated Reasoning, Vol. 50, Núm. 1, pp. 51-98

  2. Proving termination of imperative programs using Max-SMT

    2013 Formal Methods in Computer-Aided Design, FMCAD 2013

  3. SMT-based array invariant generation

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

  4. The recursive path and polynomial ordering for first-order and higher-order terms

    Journal of Logic and Computation, Vol. 23, Núm. 1, pp. 263-305

2012

  1. Nominal completion for rewrite systems with binders

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

  2. SAT modulo linear arithmetic for solving polynomial constraints

    Journal of Automated Reasoning, Vol. 48, Núm. 1, pp. 107-131

2009

  1. Solving non-linear polynomial arithmetic via SAT modulo linear arithmetic

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