Expand description
tpt-telos formal verifier (QF_LRA).
Provides a self-contained SMT-style engine that decides whether a set of
linear arithmetic constraints is unsatisfiable, and uses it to prove that
each ensures clause and invariant of a function follows from its
requires and mutate state assignments.
The default solver is an internal Fourier-Motzkin variable elimination
engine. When the z3 feature is enabled, an alternative Z3-backed solver
is available via [SolverBackend::Z3].
Re-exports§
pub use solver::counterexample;pub use solver::entails;pub use solver::model;pub use solver::negate;pub use solver::satisfies_model;pub use solver::unsat;pub use solver::unsat_checked;pub use solver::Model;pub use verify::is_unsat;pub use verify::verify;pub use verify::CheckResult;pub use verify::VerificationResult;
Modules§
- cluster
- Distributed solver cluster for tpt-telos.
- solver
- A self-contained decision procedure for the quantifier-free linear arithmetic fragment (QF_LRA) over the reals, which is a sound over-approximation of integer arithmetic: if a set of constraints is unsatisfiable over the reals, it is also unsatisfiable over the integers.
- verify
- Top-level verification driver over a
VerificationProblem.
Enums§
- Solver
Backend - The solver backend to use for verification.
Functions§
- set_
solver_ backend - Set the global solver backend.
- solver_
backend - Get the current solver backend.