Wrap up SAT/SMT

This commit is contained in:
2025-06-12 15:13:07 -06:00
parent cf41adb1f5
commit 589a55d8cd
26 changed files with 240 additions and 1 deletions

10
tools/pmc/_index.md Normal file
View File

@@ -0,0 +1,10 @@
+++
title = "All PMC Tools"
layout = "section"
+++
This page lists all of the SAT & SMT tools on this site in alphabetical order.
Click a tool name in the first column to view tool details.
Click a colorful item in the second column to view all the tools for which that term applies.
Item colors mean nothing and are intended to make it easy to skim the page.
Colors are generated by hashing each term's name and converting it to RGB color values.

22
tools/pmc/stamina.md Normal file
View File

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = true
title = 'STAMINA TODO'
subtitle = 'Probabilistic Model Checker'
links = [
{ title = "Homepage", url = "https://cvc5.github.io/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/dreal/dreal4", icon = 'fa-brands fa-github' },
{ title = "Playground", url = "https://cvc5.github.io/app/", icon = 'fa-solid fa-gamepad' }
]
applications = ['Probabilistic Model Checker', 'Rare Events']
developers = ['Utah State University']
licenses = ['BSD']
inputs = ['SMTLIB2']
interfaces = ['CLI', 'Online']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
publications = ['Barbosa2022']
+++
<!-- {{<inactive year="2023">}} -->
cvc5 is an automatic theorem prover for SMT problems.

10
tools/sat-smt/_index.md Normal file
View File

@@ -0,0 +1,10 @@
+++
title = "All SAT & SMT Tools"
layout = "section"
+++
This page lists all of the SAT & SMT tools on this site in alphabetical order.
Click a tool name in the first column to view tool details.
Click a colorful item in the second column to view all the tools for which that term applies.
Item colors mean nothing and are intended to make it easy to skim the page.
Colors are generated by hashing each term's name and converting it to RGB color values.

22
tools/sat-smt/bitwuzla.md Normal file
View File

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'Bitwuzla'
subtitle = 'SMT Solver'
links = [
{ title = "Homepage", url = "https://bitwuzla.github.io", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/bitwuzla/bitwuzla", icon = 'fa-brands fa-github' },
# { title = "Playground", url = "https://jfmc.github.io/z3-play/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
developers = ['Stanford University']
licenses = ['MIT']
inputs = ['SMTLIB2']
interfaces = ['CLI']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
publications = ['Niemetz2023']
+++
<!-- {{<inactive year="2024">}} -->
Bitwuzla is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.

View File

@@ -0,0 +1,23 @@
+++
date = 2025-06-07
draft = false
title = 'Boolector'
subtitle = 'SMT Solver'
links = [
{ title = "Homepage", url = "https://boolector.github.io/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/boolector/boolector", icon = 'fa-brands fa-github' },
# { title = "Playground", url = "https://jfmc.github.io/z3-play/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
developers = ['Stanford University', 'Johannes Kepler Universität Linz']
licenses = ['MIT']
inputs = ['SMTLIB2']
interfaces = ['CLI']
maintenance = ['Not Maintained']
# techniques = ['CDCL']
publications = ['Niemetz2014']
+++
{{<inactive year="2024">}}
Boolector is a Satisfiability Modulo Theories (SMT) solver for the theories of fixed-size bit-vectors, arrays and uninterpreted functions.
Succeeded by [Bitwuzla](../bitwuzla)

21
tools/sat-smt/colibri.md Normal file
View File

@@ -0,0 +1,21 @@
+++
date = 2025-06-07
draft = false
title = 'Colibri'
subtitle = 'SMT Solver'
links = [
{ title = "Homepage", url = "https://colibri.frama-c.com/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://git.frama-c.com/pub/colibrics/-/tree/master", icon = 'fa-brands fa-github' },
# { title = "Playground", url = "https://jfmc.github.io/z3-play/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver']
developers = ['CEA']
licenses = ['MIT']
inputs = ['SMTLIB2']
interfaces = ['CLI']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
Colibri is an SMT solver.

View File

@@ -0,0 +1,33 @@
+++
date = 2025-06-07
draft = false
title = 'CryptoMiniSat'
subtitle = 'SAT Solver'
links = [
{ title = "Homepage", url = "https://www.msoos.org/cryptominisat5/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/msoos/cryptominisat", icon = 'fa-brands fa-github' },
# { title = "Playground", url = "https://cvc4.github.io/app/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SAT Solver']
developers = ['INRIA Rhône-Alpes', 'University of Virginia']
licenses = ['MIT', 'GPLv2']
inputs = ['CNF']
interfaces = ['CLI', 'Python', 'C++', ]
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
publications = ['Soos2009']
+++
<!-- {{<inactive year="2021">}} -->
CryptoMiniSat is a SAT solver.
## APIs and Bindings
This tool is available through the following interfaces:
- **C++ Namespace:** Documentation on [homepage](https://www.msoos.org/cryptominisat5/)
- **Python package:** [PyPI package](https://pypi.org/project/pycryptosat/)
<!-- - **.NET API:** [Z3 .NET Namespace Reference](https://z3prover.github.io/api/html/namespace_microsoft_1_1_z3.html) -->
<!-- - **Java API:** [Z3 Java API Reference](https://z3prover.github.io/api/html/namespacecom_1_1microsoft_1_1z3.html) -->
<!-- - **Rust bindings:** [z3 crate on crates.io](https://crates.io/crates/z3) -->

22
tools/sat-smt/cvc4.md Normal file
View File

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'cvc4'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://cvc4.github.io/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/CVC4/CVC4-archived", icon = 'fa-brands fa-github' },
{ title = "Playground", url = "https://cvc4.github.io/app/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover']
developers = ['Stanford University', 'University of Iowa']
licenses = ['BSD']
inputs = ['SMTLIB2']
interfaces = ['CLI', 'Online']
maintenance = ['Not Maintained']
# techniques = ['CDCL']
publications = ['Barrett2011']
+++
{{<inactive year="2021">}}
cvc4 is an automatic theorem prover for SMT problems. It is succeeded by [cvc5](../cvc5)

22
tools/sat-smt/cvc5.md Normal file
View File

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'cvc5'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://cvc5.github.io/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/cvc5/cvc5", icon = 'fa-brands fa-github' },
{ title = "Playground", url = "https://cvc5.github.io/app/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover']
developers = ['Stanford University', 'University of Iowa']
licenses = ['BSD']
inputs = ['SMTLIB2']
interfaces = ['CLI', 'Online']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
publications = ['Barbosa2022']
+++
<!-- {{<inactive year="2023">}} -->
cvc5 is an automatic theorem prover for SMT problems.

22
tools/sat-smt/dreal.md Normal file
View File

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'dReal'
subtitle = 'SMT Solver'
links = [
{ title = "Homepage", url = "https://dreal.github.io/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/dreal/dreal4", icon = 'fa-brands fa-github' },
# { title = "Playground", url = "https://jfmc.github.io/z3-play/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver']
# developers = ['Johannes Kepler Universität Linz']
licenses = ['Apache-2.0']
# inputs = ['']
interfaces = ['CLI']
maintenance = ['Not Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
{{<inactive year="2023">}}
dReal is an automated reasoning tool. It focuses on solving problems that can be encoded as first-order logic formulas over the real numbers. Its special strength is in handling problems that involve a wide range of nonlinear real functions.

View File

@@ -10,7 +10,7 @@ links = [
]
applications = ['SMT Solver']
developers = ['Fondazione Bruno Kessler','DISI-University of Trento']
licenses = ['All rights reserved']
licenses = ['All Rights Reserved']
# inputs = ['']
interfaces = ['CLI']
maintenance = ['Actively Maintained']

View File

@@ -0,0 +1,10 @@
+++
title = "All Termination Tools"
layout = "section"
+++
This page lists all of the termination tools on this site in alphabetical order.
Click a tool name in the first column to view tool details.
Click a colorful item in the second column to view all the tools for which that term applies.
Item colors mean nothing and are intended to make it easy to skim the page.
Colors are generated by hashing each term's name and converting it to RGB color values.

View File

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = true
title = 'AProVE TODO'
subtitle = 'Probabilistic Model Checker'
links = [
{ title = "Homepage", url = "https://cvc5.github.io/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/dreal/dreal4", icon = 'fa-brands fa-github' },
{ title = "Playground", url = "https://cvc5.github.io/app/", icon = 'fa-solid fa-gamepad' }
]
applications = ['Probabilistic Model Checker', 'Rare Events']
developers = ['Utah State University']
licenses = ['BSD']
inputs = ['SMTLIB2']
interfaces = ['CLI', 'Online']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
publications = ['Barbosa2022']
+++
<!-- {{<inactive year="2023">}} -->
cvc5 is an automatic theorem prover for SMT problems.