๐Ÿš€ AProVE is now open source!

For more than two decades, our group at RWTH Aachen University has been developing AProVE โ€” one of the most powerful systems for fully automated termination, complexity, and safety proofs. As of now, its source code is publicly available under the LGPL. ๐ŸŽ‰

AProVE automatically answers questions that are undecidable in general, yet it handles them remarkably well in practice: โœ… Does this program terminate on every input? โฑ๏ธ How costly can its execution become in the worst case?

And it does so not only for term rewrite systems, but for many real-world languages and formalisms: ๐Ÿ”น Java (bytecode) ๐Ÿ”น C / LLVM ๐Ÿ”น Haskell ๐Ÿ”น Prolog ๐Ÿ”น Integer transition systems ๐Ÿ”น Probabilistic programs & probabilistic term rewriting

Along the way, AProVE has earned numerous first places at the annual International Termination Competition, strong results at SV-COMP, and two Kurt Gรถdel medals at the Vienna Summer of Logic 2014.

With this release, AProVEโ€™s modular framework of processors, strategies, and backend solvers is open for everyone to study, use, and extend. Want to add support for a new language, plug in your own analysis technique, or integrate another solver? Contributions are very welcome!

๐Ÿ”— Code: https://github.com/aprove-developers/aprove-open-source ๐ŸŒ Website: https://aprove.informatik.rwth-aachen.de

#OpenSource #FormalMethods #ProgramVerification #TerminationAnalysis #TermRewriting #RWTHAachen #ResearchSoftware