Download free course SAT/SMT by Example, pdf file on 585 pages by Dennis Yurichev.
SAT/SMT solvers can be viewed as solvers of huge systems of equations. The difference is that SMT solvers takes systems in arbitrary format, while SAT solvers are limited to boolean equations in CNF 1 form. A lot of real world problems can be represented as problems of solving system of equations.
Table of contents
- Introduction
- Basics
- Equations
- Proofs
- Verification
- Regular expressions
- Gray code
- Recreational mathematics and puzzles
- Graph coloring
- Knapsack problems
- Social Golfer Problem
- Latin squares
- Cyclic redundancy check
- MaxSAT/MaxSMT
- Synthesis
- Toy decompiler
- Symbolic execution
- KLEE
- (Amateur) cryptography
- First-Order Logic
- Cellular automata
- Everything else
- Toy-level solvers
- Glossary (SAT)
- Further reading
- Some applications
- Acronyms used
Pages : | 585 |
Size : | 6.1 MB |
Downloads: | 49 |
Created: | 2022-02-03 |
License: | Open Publication License |
Author(s): | Dennis Yurichev |
Warning: Trying to access array offset on false in /home/tutovnfz/public_html/amp/article-amp.php on line 263
Others related eBooks about SAT/SMT by Example
Download free course The Express Handbook, pdf file on 61 pages by Flavio Copes.
Download free course Managing Projects with GNU Make, pdf file on 272 pages by Robert Mecklenburg.
Download free course Mercurial: The Definitive Guide, pdf file on 282 pages by Bryan O'Sullivan.
Download free course Tensorflow 2 Tutorial, pdf file on 66 pages by Ren Zhang.
Download free course Don't Panic: Mobile Developer's Guide to The Galaxy, pdf file on 337 pages by Marco Tabor, Mladenka Vrdoljak.