Recent from talks
All channels
Be the first to start a discussion here.
Be the first to start a discussion here.
Be the first to start a discussion here.
Be the first to start a discussion here.
Welcome to the community hub built to collect knowledge and have discussions related to T2 Temporal Prover.
Nothing was collected or created yet.
T2 Temporal Prover
View on Wikipediafrom Wikipedia
| T2 Temporal Prover | |
|---|---|
| Original author | Microsoft Research |
| Developer | Microsoft |
| Stable release | CADE_2017
/ May 30, 2017 |
| Written in | C, F# |
| Operating system | Windows, Linux (Debian, Ubuntu), macOS |
| Platform | .NET Framework, Mono |
| Type | Program analyzer |
| License | MIT License |
| Website | www |
| Repository | github |
T2 Temporal Prover is an automated program analyzer developed in the Terminator research project at Microsoft Research.
Overview
[edit]T2 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.
The source code is licensed under MIT License and hosted on GitHub.[2]
References
[edit]- ^ Rob Knies. "Terminator Tackles an Impossible Task". Retrieved 2010-05-25.
- ^ "GitHub - mmjb/T2: T2 Temporal Prover". December 4, 2019 – via GitHub.
Further reading
[edit]- Marc Brockschmidt; Byron Cook; Samin Ishtiaq; Heidy Khlaaf; Nir Piterman (2016). "T2: Temporal Property Verification". Proceedings of TACAS'16. Springer. arXiv:1512.08689.
External links
[edit]- T2 Temporal Logic Prover on GitHub
- T2: Temporal Property Verification publication at Microsoft Research
- Terminator Research Project at the Wayback Machine (archived October 4, 2013)
