97 citations · 156 across the 13 of their papers we have counts for
7 papers · 1 filter
An Effective Orchestral Approach to Satisfiability Modulo Prime Fields
Miguel Isabel, Enric Rodríguez-Carbonell, Clara Rodríguez-Núñez +1
Zero-knowledge proofs (ZKPs) are an emerging technology that has become the solution to efficiently provide security and privacy along with the transparency requirement of blockcha…
Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers
Cristina Borralleras, Daniel Larraz, Albert Oliveras +2
We present new methods for solving the Satisfiability Modulo Theories problem over the theory of Quantifier-Free Non-linear Integer Arithmetic, SMT(QF-NIA), which consists in decid…
Compositional Safety Verification with Max-SMT
Marc Brockschmidt, Daniel Larraz, Albert Oliveras +2
We present an automated compositional program verification technique for safety properties based on conditional inductive invariants. For a given program part (e.g., a single loop)…
The computability path ordering
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability pa…
The computability path ordering: the end of a quest
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we p…
HORPO with Computability Closure : A Reconstruction
Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
This paper provides a new, decidable definition of the higher- order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for…