In this paper we report on our experiments in using the currently popular Smt (Sat Modulo
Theories) solvers Yices [10] and Cvc3 [1] and the Simplify theorem prover [9] to discharge …

We have constructed a tool for using SMT (SAT Modulo Theories) solvers to discharge
verification conditions (VCs) from programs written in the SPARK language. The tool has API …

A significant application domain for SMT solvers is in the analysis, verification, testing and
construction of programs. This chapter covers some of these areas where SMT solvers have …

We present VS 3, a tool that automatically verifies complex properties of programs and infers
maximally weak preconditions and maximally strong postconditions by leveraging the power …

Abstract Satisfiability Modulo Theory (SMT) solvers received a lot of attention in the research
community in the last decade, and consequently their expressiveness and performance …

Abstract Modern Satisfiability Modulo Theories (SMT) solvers are used in a wide variety of
software and hardware verification applications. Proof producing SMT solvers are very …

Mechanical proof assistants have always had support for inductive proofs. Sometimes an
alternative to proof assistants, satisfiability modulo theories (SMT) solvers bring the hope of …

There is increasing interest in applying verification tools to programs that have bitvector
operations. SMT solvers, which serve as a foundation for these tools, have thus increased …

In this thesis, we explore techniques for the development and verification of programs in a
high-level, expressive, and safe programming language. Our programs can express …

Abstract Satisfiability Modulo Theories (SMT) is an enabling technology with many
applications, especially in computer-aided verification. Due to advances in research and …