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