Microsoft Terminator
Terminator, a research project at Microsoft Research, is an automated program analyzer that aims to find whether a program can run infinitely (called a termination analysis). It supports nested loops and recursive functions, pointers and side-effects, and function-pointers as well as concurrent programs. Like all programs for termination analysis it tries to solve the halting problem for particular cases, since the general problem is undecidable.[1] It provides a solution which is sound, meaning that when it states that a program does always terminate, the result is dependable.
References
- ↑ Rob Knies. "Terminator Tackles an Impossible Task". Retrieved 2010-05-25.
External links
- Terminator Research Project at the Wayback Machine (archived 2013-10-04)
- T2: Temporal Property Verification publication at Microsoft Research
- T2 Temporal Logic Prover on GitHub
This article is issued from
Wikipedia.
The text is licensed under Creative Commons - Attribution - Sharealike.
Additional terms may apply for the media files.