The UCLID decision procedure
From MaRDI portal
Recommendations
- Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- CVC: A cooperating validity checker
- Modeling and verification of out-of-order microprocessors in UCLID
- EufDPLL -- a tool to check satisfiability of equality logic formulas
Cited in
(10)- Parallelizing SMT solving: lazy decomposition and conciliation
- Editorial: Symbolic computation and satisfiability checking
- Building small equality graphs for deciding equality logic with uninterpreted functions
- Linear Arithmetic with Stars
- Combining theories with shared set operations
- Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Formal reliability analysis of redundancy architectures
- Deciding Boolean algebra with Presburger arithmetic
- A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures
This page was built for publication: The UCLID decision procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312932)