research
∙
07/15/2023
Combining Finite Combination Properties: Finite Models and Busy Beavers
This work is a part of an ongoing effort to understand the relationships...
share
research
∙
05/10/2023
DNN Verification, Reachability, and the Exponential Function Problem
Deep neural networks (DNNs) are increasingly being deployed to perform s...
research
∙
05/03/2023
Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness
We make two contributions to the study of theory combination in satisfia...
research
∙
05/17/2022
Reasoning About Vectors using an SMT Theory of Sequences
Dynamic arrays, also referred to as vectors, are fundamental data struct...
research
∙
05/07/2021
lazybvtoint at the SMT Competition 2020
lazybvtoint is a new prototype SMT-solver, that will participate in the ...
research
∙
04/23/2021
Politeness and Stable Infiniteness: Stronger Together
We make two contributions to the study of polite combination in satisfia...
research
∙
04/10/2020
Resources: A Safe Language Abstraction for Money
Smart contracts are programs that implement potentially sophisticated tr...
research
∙
04/09/2020
Politeness for the Theory of Algebraic Datatypes
Algebraic datatypes, and among them lists and trees, have attracted a lo...
research
∙
08/26/2019
Verifying Bit-vector Invertibility Conditions in Coq (Extended Abstract)
This work is a part of an ongoing effort to prove the correctness of inv...
research
∙
06/28/2019
DRAT-based Bit-Vector Proofs in CVC4
Many state-of-the-art Satisfiability Modulo Theories (SMT) solvers for t...
research
∙
05/24/2019
Towards Bit-Width-Independent Proofs in SMT Solvers
Many SMT solvers implement efficient SAT-based procedures for solving fi...
research
∙
01/12/2018