A Tutorial on Satisfiability Modulo Theories

DOI10.1007/978-3-540-73368-3_5zbMath1135.68563OpenAlexW1559793414MaRDI QIDQ5429314

Bruno Dutertre, Natarajan Shankar, Leonardo de Moura

Publication date: 29 November 2007

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73368-3_5

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Certifying low-level programs with hardware interrupts and preemptive threads ⋮ A logic-based Benders decomposition for microscopic railway timetable planning ⋮ Unnamed Item ⋮ Verification conditions for source-level imperative programs ⋮ The Mechanical Verification of a DPLL-Based Satisfiability Solver ⋮ Accelerating logic-based benders decomposition for railway rescheduling by exploiting similarities in delays

Uses Software

• MiniSat
• Walksat
• Siege
• SATO
• Chaff
• FOCI