swMATH28679MaRDI QIDQ40393FDOQ40393
Author name not available (Why is that?)
Official website: https://pdfs.semanticscholar.org/3848/8bf963baecc37212e6f19cfc037850790601.pdf
Cited In (7)
- Building bridges between symbolic computation and satisfiability checking
- Invariant checking of NRA transition systems via incremental reduction to LRA with EUF
- CArL
- SMT-RAT
- HyComp
- \textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
This page was built for software: iSAT
