Microsoft Terminator
From Wikipedia, the free encyclopedia
Terminator, a research project at Microsoft Research is an automated program analyzer that aims to prove whether a program will run infinitely (so called 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]
References
- ↑ Rob Knies. "Terminator Tackles an Impossible Task". Retrieved 2010-05-25.
External links
|
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.