Microsoft Terminator

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Terminator, a research project at Microsoft Research is an automated program analyzer that aims to find whether a program can 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] It provides a solution which is sound, meaning that when it states that a program does always terminate, the result is dependable.

References[edit]

  1. ^ Rob Knies. "Terminator Tackles an Impossible Task". Retrieved 2010-05-25. 

External links[edit]