Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ychen306
on May 20, 2019
|
parent
|
context
|
favorite
| on:
Modern SAT solvers: fast, neat and underused
Program verification. E.g. when you want to prove that certain condition/path (e.g. asserts) is unreachable.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: