Cited in
(33)- Computer Aided Verification
- Lazy satisfiability modulo theories
- A Decision Procedure for Bit-Vectors and Arrays
- scientific article; zbMATH DE number 1979548 (Why is no real title available?)
- Correct Hardware Design and Verification Methods
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
- Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
- A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures
- Deciding Bit-Vector Arithmetic with Abstraction
- Combining theories with shared set operations
- Formal reliability analysis of redundancy architectures
- BarcelogicTools
- Siege
- zChaff
- Zap
- SPNP
- CVC
- PiMaG
- Skeptik
- EVC
- Automated Deduction – CADE-20
- Building small equality graphs for deciding equality logic with uninterpreted functions
- Parallelizing SMT solving: lazy decomposition and conciliation
- Interpolant based decision procedure for quantifier-free Presburger arithmetic
- Zap: Automated Theorem Proving for Software Analysis
- Formal Verification of Infinite State Systems Using Boolean Methods
- Building a calculus of data structures
- scientific article; zbMATH DE number 5613976 (Why is no real title available?)
- Disequality management in integer difference logic via finite instantiations.
- Linear Arithmetic with Stars
- Computer Aided Verification
- Editorial: Symbolic computation and satisfiability checking
- Deciding Boolean algebra with Presburger arithmetic
This page was built for software: UCLID
