fmtools/content
1
0
Fork 0
Code Issues 14 Pull Requests Actions Packages Releases Wiki Activity

Close #17, add tools

Browse Source
This commit is contained in:
Landon Taylor
2025-08-21 16:14:46 -06:00
parent f1f2354db2
commit 97a87a1679
9 changed files with 189 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'Abella'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://abella-prover.org/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "github.com/abella-prover/abella", icon = 'fa-solid fa-code' },
# { title = "Playground", url = "https://www.why3.org/try/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
developers = ['Inria']
licenses = ['GPLv3']
inputs = ['WhyML']
interfaces = ['CLI', 'Why3']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
<!-- {{<inactive year="2011">}} -->
Abella is an interactive theorem prover based on lambda-tree syntax.

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

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'BEAGLE'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://bitbucket.org/peba123/beagle/src/master/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://bitbucket.org/peba123/beagle/src/master/", icon = 'fa-solid fa-code' },
# { title = "Playground", url = "https://www.why3.org/try/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
developers = ['CSIRO']
licenses = ['MIT']
inputs = ['WhyML']
interfaces = ['CLI', 'Online']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
<!-- {{<inactive year="2016">}} -->
Beagle is an automated theorem prover for first-order logic with equality over linear integer/rational/real arithmetic.

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

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'Gappa'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://gappa.gitlabpages.inria.fr/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://gitlab.inria.fr/gappa/gappa", icon = 'fa-solid fa-code' },
# { title = "Playground", url = "https://www.why3.org/try/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
developers = ['Inria']
licenses = ['MIT']
inputs = ['WhyML']
interfaces = ['CLI', 'Why3', 'Coq']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
<!-- {{<inactive year="2016">}} -->
Gappa is a tool intended to help verifying and formally proving properties on numerical programs dealing with floating-point or fixed-point arithmetic.

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

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'Metis'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://www.gilith.com/software/metis/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/gilith/metis", icon = 'fa-solid fa-code' },
# { title = "Playground", url = "https://www.why3.org/try/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
developers = ['Intel']
licenses = ['MIT']
inputs = ['WhyML']
interfaces = ['CLI', 'Why3']
maintenance = ['Not Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
{{<inactive year="2020">}}
Metis is an automatic theorem prover for first order logic with equality.

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

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'MetiTarski'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://www.cl.cam.ac.uk/~lp15/papers/Arith/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://bitbucket.org/lcpaulson/metitarski-git", icon = 'fa-solid fa-code' },
# { title = "Playground", url = "https://www.why3.org/try/", icon = 'fa-solid fa-gamepad' }
]
applications = ['University of Cambridge']
developers = ['Inria']
licenses = ['MIT']
inputs = ['WhyML']
interfaces = ['CLI', 'Why3']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
<!-- {{<inactive year="2022">}} -->
MetiTarski is an automatic theorem prover based on a combination of resolution and a decision procedure for the theory of real closed fields.

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

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'Princess'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "http://www.philipp.ruemmer.org/princess.shtml", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/uuverifiers/princess", icon = 'fa-solid fa-code' },
{ title = "Playground", url = "https://eldarica.org/princess/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
developers = ['Uppsala University']
licenses = ['MIT']
inputs = ['WhyML']
interfaces = ['CLI', 'Why3']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
<!-- {{<inactive year="2022">}} -->
Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic with uninterpreted predicates, written entirely in Scala.

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

@@ -0,0 +1,22 @@
+++
date = 2025-06-07
draft = false
title = 'Profound'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://chaudhuri.info/software/profound/", icon = 'fa-solid fa-home' },
{ title = "Source Code", url = "https://github.com/direct-manipulation/profound", icon = 'fa-solid fa-code' },
# { title = "Playground", url = "https://www.why3.org/try/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
developers = ['Inria']
licenses = ['MIT']
inputs = ['WhyML']
interfaces = ['CLI', 'Why3']
maintenance = ['Not Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
{{<inactive year="2011">}}
Profound is an experiment in subformula linking as an interaction method.

23
tools/sat-smt/spass.md Normal file
View File

@@ -0,0 +1,23 @@
+++
date = 2025-06-07
draft = false
title = 'SPASS'
subtitle = 'Theorem Prover'
links = [
{ title = "Homepage", url = "https://www.mpi-inf.mpg.de/departments/automation-of-logic/software/spass-workbench/classic-spass-theorem-prover", icon = 'fa-solid fa-home' },
# { title = "Source Code", url = "https://github.com/abella-prover/abella", icon = 'fa-solid fa-code' },
# { title = "Playground", url = "https://www.why3.org/try/", icon = 'fa-solid fa-gamepad' }
]
applications = ['SMT Solver', 'Theorem Prover', 'SAT Solver']
developers = ['Inria']
licenses = ['All Rights Reserved']
inputs = ['WhyML']
interfaces = ['CLI', 'Why3']
maintenance = ['Actively Maintained']
# techniques = ['CDCL']
# publications = ['deMoura2008']
+++
{{<closed-source>}}
<!-- {{<inactive year="2011">}} -->
SPASS: An Automated Theorem Prover for First-Order Logic with Equality