Formal Verification with SMT Solvers: Why and How

Abstract

There have been various methods devised to verify the correctness of programs that range from undecidable computational logics describing the semantics of a program to the more brute-force method of exploring the entire state space of a program to ensure certain properties are never violated. In this paper we advocate that a compromise between the two, a… (More)

Topics

1 Figure or Table