<p>Yes, an example of a system that performs this task is T2. It does not solve the halting problem but instead it only attempts to solve certain special cases. A overview is at <a href="https://en.wikipedia.org/wiki/Microsoft_Terminator" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Microsoft_Terminator</a> . The newest version of this system is at <a href="https://mmjb.github.io/T2/" rel="nofollow noreferrer">https://mmjb.github.io/T2/</a> .</p>

CC BY-SA 3.0
2018-01-06T23:52:54.577Z
2018-01-06T23:52:54.577Z
Joshua Herman
<p>What kinds of systems are available that accept a certain program $P$ and attempts to figure out "the program does terminate" or "the program does not terminate" and output a proof of one or the other?</p>

<proof-theory><software><halting-problem><program-analysis>
Practical approaches to solving whether programs will halt
Joshua Herman
# Practical approaches to solving whether programs will halt

(Asked by: username_0 on 2018-01-06)

What kinds of systems are available that accept a certain program $P$ and attempts to figure out "the program does terminate" or "the program does not terminate" and output a proof of one or the other?

**Tags:** proof-theory, software, halting-problem, program-analysis


---

## 1 answers

### Answer by username_0 on 2018-01-06. Score: 4 | Accepted answer

Yes, an example of a system that performs this task is T2. It does not solve the halting problem but instead it only attempts to solve certain special cases. A overview is at <https://en.wikipedia.org/wiki/Microsoft_Terminator> . The newest version of this system is at <https://mmjb.github.io/T2/> .


---

