Test case generation of classic N-Puzzle game using Z3
-
Updated
Dec 14, 2015 - Python
Test case generation of classic N-Puzzle game using Z3
This repository is a source code of my master thesis. In my master thesis, I developed a prototype to translate TLA+ expressions to the SMT-LIB language, and to verify safety properties with SMT solvers, IC3-based techniques and user-guided predicate abstraction.
Counter-example guided inductive synthesis (CEGIS) implementation for the SMT solver Z3 by Microsoft Research
A reference implementation of PDR for boolean transition systems
A Golang wrapper for the Z3 SMT solver
Vega-Lite and Compassql as constraints
Hands-on Constraint Solving: Sudoku to SAT/SMT
A toy code generator (i.e. "program synthesis") using the Z3 solver
Symbolic execution engine for the Ethereum VM
Randomized Response by boolean circuits and z3
Solution finder for a popular mobile game "Flow Free". Solution for this game is in NP-Complete. Derived a polynomial time reduction algorithm to reduce the problem to satisfiability problem.
Verify Regulation Kernels using SMT. This repository is a public mirror, pull requests will be merged manually.
Add a description, image, and links to the z3 topic page so that developers can more easily learn about it.
To associate your repository with the z3 topic, visit your repo's landing page and select "manage topics."