Boolean satisfiability with transitivity constraints

DOI10.1145/566385.566390zbMath1365.68318OpenAlexW2104115705MaRDI QIDQ5738967

Miroslav N. Velev, Randal E. Bryant

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/566385.566390

zbMATH Keywords

formal verificationBoolean satisfiabilitydecision procedures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Satisfiability Modulo Theories, Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem, Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors., Transforming equality logic to propositional logic, EufDpll - A Tool to Check Satisfiability of Equality Logic Formulas