Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

TPHOL
2007
IEEE

favoriteEmaildiscussreport

125views Automated Reasoning» more TPHOL 2007»

Proof Pearl: The Termination Analysis of Terminator

13 years 10 months ago

Proof Pearl: The Termination Analysis of Terminator

Download www.gilith.com

Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in higher order logic of the program analysis employed by Terminator, and veriﬁes that if the analysis succeeds then program termination logically follows.

Joe Hurd

Real-time Traffic

Artificial Intelligence | Program Termination | Static Analysis Tool | TPHOL 2007 | Windows Device Drivers |

claim paper

Related Content

» Interactive Termination Proofs Using Termination Cores

» Automatic Termination Proofs for Programs with ShapeShifting Heaps

» Termination of justfair computations in term rewriting

» Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting

» Termination Analysis with Algorithmic Learning

» On Termination of Binary CLP Programs

» The Dependency Pair Framework Combining Techniques for Automated Termination Proofs

» Termination proofs for systems code

» A3PAT an approach for certified automated termination proofs

Post Info
More Details (n/a)

Added	04 Jun 2010
Updated	04 Jun 2010
Type	Conference
Year	2007
Where	TPHOL
Authors	Joe Hurd

Comments (0)