cvc5: A versatile and industrial-strength SMT solver
Abstract cvc5 is the latest SMT solver in the cooperating validity checker series and builds
on the successful code base of CVC4. This paper serves as a comprehensive system …
on the successful code base of CVC4. This paper serves as a comprehensive system …
Egg: Fast and extensible equality saturation
An e-graph efficiently represents a congruence relation over many expressions. Although
they were originally developed in the late 1970s for use in automated theorem provers, a …
they were originally developed in the late 1970s for use in automated theorem provers, a …
Z3: An efficient SMT solver
L De Moura, N Bjørner - International conference on Tools and Algorithms …, 2008 - Springer
Abstract Satisfiability Modulo Theories (SMT) problem is a decision problem for logical first
order formulas with respect to combinations of background theories such as: arithmetic, bit …
order formulas with respect to combinations of background theories such as: arithmetic, bit …
Satisfiability modulo theories
Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
Verus: Verifying rust programs using linear ghost types
The Rust programming language provides a powerful type system that checks linearity and
borrowing, allowing code to safely manipulate memory without garbage collection and …
borrowing, allowing code to safely manipulate memory without garbage collection and …
[图书][B] Decision procedures
D Kroening, O Strichman - 2016 - Springer
A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …
correct yes/no answer. In this book, we focus on decision procedures for decidable first …
Learning invariants using decision trees and implication counterexamples
Inductive invariants can be robustly synthesized using a learning model where the teacher is
a program verifier who instructs the learner through concrete program configurations …
a program verifier who instructs the learner through concrete program configurations …
Complete instantiation for quantified formulas in satisfiabiliby modulo theories
Y Ge, L De Moura - … Aided Verification: 21st International Conference, CAV …, 2009 - Springer
Abstract Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing
challenge. The practical method employed in modern SMT solvers is to instantiate quantified …
challenge. The practical method employed in modern SMT solvers is to instantiate quantified …
Counterexample-guided quantifier instantiation for synthesis in SMT
We introduce the first program synthesis engine implemented inside an SMT solver. We
present an approach that extracts solution functions from unsatisfiability proofs of the …
present an approach that extracts solution functions from unsatisfiability proofs of the …
[图书][B] Automotive embedded systems handbook
N Navet, F Simonot-Lion - 2017 - books.google.com
A Clear Outline of Current Methods for Designing and Implementing Automotive Systems
Highlighting requirements, technologies, and business models, the Automotive Embedded …
Highlighting requirements, technologies, and business models, the Automotive Embedded …