Solving difficult SMT instances using abstractions and incremental SMT solving 1. Jan 2020· Samuel Teuber · 0 min read Cite Type Thesis Last updated on 1. Jan 2020 Formal Methods Authors Samuel Teuber PhD Candidate Researching formal verification of AI-based heterogeneous systems, with applications in neural network control and algorithmic fairness. ← An Incremental Abstraction Scheme for Solving Hard SMT-Instances over Bit-Vectors 23. Aug 2020 Efficient unpacking of required software from CERNVM-FS 1. Feb 2019 →