Date: 2016-02-01 08:36:29

Recursion

Theoretical computer science

Formal methods

Compiler optimizations

Infinite loop

Satisfiability modulo theories

Control flow

For loop

Algorithm

Termination analysis

Loop unrolling

Satisfiability

A Fixed-Point Algorithm for Automated Static Detection of Infinite Loops Andreas Ibing, Alexandra Mai Chair for IT Security TU M¨unchen Boltzmannstrasse 3, 85748 Garching, Germany {ibing,mai}@sec.in.tum.de

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 218,82 KB