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: | 206 |
| Created: | 2022-02-03 |
| License: | Open Publication License |
| Author(s): | Dennis Yurichev |
Others related eBooks about SAT/SMT by Example
Download free course Foundations of Software Science and Computation Structures, pdf file on 556 pages by Miko?aj Boja?czyk, Alex Simpson.
Download free course Digital Video Concepts, Methods, and Metrics, pdf file on 359 pages by Shahriar Akramullah.
Download free course An Introduction to Matlab and Mathcad, pdf file on 136 pages by by Troy Siemers.
Download free course GNU GREP and RIPGREP, pdf file on 111 pages by Sundeep Agarwal.
Download free course Computational Thinking Education, pdf file on 377 pages by Siu-Cheung Kong, Harold Abelson.