mirror of
https://github.com/Z3Prover/z3
synced 2026-03-07 13:54:53 +00:00
initial spec
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
d906a0cc2d
commit
d1468bc09d
4 changed files with 20 additions and 0 deletions
BIN
spec/ClemensTableau.pdf
Normal file
BIN
spec/ClemensTableau.pdf
Normal file
Binary file not shown.
BIN
spec/LazyMemberships.pdf
Normal file
BIN
spec/LazyMemberships.pdf
Normal file
Binary file not shown.
12
spec/plan.md
Normal file
12
spec/plan.md
Normal file
|
|
@ -0,0 +1,12 @@
|
|||
Your task is to implement the theory solver for strings that is described in the resources under reference.md
|
||||
|
||||
The theory solver should be implemented as a theory solver in src/smt. Call it theory\_nseq.
|
||||
|
||||
Add a parameter setting to control whether using the default string solver theory\_seq or theory\_nseq or the empty string solver.
|
||||
|
||||
Utilities that can be made self-contained go in the directory ast/rewriter.
|
||||
|
||||
|
||||
|
||||
Start out by creating a plan for this implementation.
|
||||
|
||||
8
spec/reference.md
Normal file
8
spec/reference.md
Normal file
|
|
@ -0,0 +1,8 @@
|
|||
A C# implementation of the procedure is here: https://github.com/CEisenhofer/ZIPT/tree/parikh/ZIPT
|
||||
|
||||
A description of the algorithm is in LazyMemberships.pdf
|
||||
|
||||
Other algorithms are descried in ClemensTableau.pdf
|
||||
|
||||
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue