the Matchbox termination prover
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
CO4/Test/TermComp2014
Compress
MB
SMT
data
release
script
.gitignore
MB.hs
README.md
Statistik.hs
build-all.sh
build-mine.sh
closuretest.hs
matchbox.cabal
release.sh
run.sh

README.md

This program proves termination of rewriting systems.

This is derived from http://dfa.imn.htwk-leipzig.de/matchbox/ . The intention is to keep the main program small, by moving re-usable components to libraries (haskell-tpdb, satchmo-smt).

Input is in TPDB syntax (plain or XTC), output is proof trace (textual, CPF).

Methods used: Matrix interpretations over natural and arctic numbers, dependency pairs transformation, compression of rewriting systems.

Constraint solvers used: glpk linear programming solver, minisat SAT solver.