2 papers
cs.LO2020
An Incremental Abstraction Scheme for Solving Hard SMT-Instances over Bit-Vectors
Samuel Teuber, Marko Kleine Büning, Carsten Sinz
Decision procedures for SMT problems based on the theory of bit-vectors are a fundamental component in state-of-the-art software and hardware verifiers. While very efficient in gen…
cs.SC2018
Unbounded Software Model Checking with Incremental SAT-Solving
Marko Kleine Büning, Tomas Balyo, Carsten Sinz
This paper describes a novel unbounded software model checking approach to find errors in programs written in the C language based on incremental SAT-solving. Instead of using the…