UCLID
From MaRDI portal
Software:16827
No author found.
Related Items (24)
Unnamed Item ⋮ Deciding Boolean algebra with Presburger arithmetic ⋮ Unnamed Item ⋮ Computer Aided Verification ⋮ A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures ⋮ Linear Arithmetic with Stars ⋮ Formal Verification of Infinite State Systems Using Boolean Methods ⋮ Zap: Automated Theorem Proving for Software Analysis ⋮ Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools ⋮ Automated Deduction – CADE-20 ⋮ Formal reliability analysis of redundancy architectures ⋮ Parallelizing SMT solving: lazy decomposition and conciliation ⋮ Unnamed Item ⋮ Correct Hardware Design and Verification Methods ⋮ Building small equality graphs for deciding equality logic with uninterpreted functions ⋮ A Decision Procedure for Bit-Vectors and Arrays ⋮ Deciding Bit-Vector Arithmetic with Abstraction ⋮ Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic ⋮ Unnamed Item ⋮ Editorial: Symbolic computation and satisfiability checking ⋮ Combining Theories with Shared Set Operations ⋮ Building a Calculus of Data Structures ⋮ Computer Aided Verification ⋮ Unnamed Item
This page was built for software: UCLID
