Sloopy computes heuristics to empirically determine difficulty of automated program analysis for loops in C programs.


Sloopy. The recommended way to build sloopy is via its Dockerfile. You may also pull a pre-built image from Docker Hub.
If you’re unfamiliar with Docker, you may still follow the steps in the Dockerfile as rough directions.

Data sets. Experiments from my Master’s thesis in JSON format.


[2] Loop Patterns in C Programs
Thomas Pani, Helmut Veith, Florian Zuleger
ECEASST, volume 72, 2015.
[bibtex] [pdf] [doi]
[1]Loop Patterns in C Programs
Thomas Pani
January 2014, Master's thesis, TU Wien.


Thomas Pani
Technische Universität Wien
Institut für Logic and Computation 192/4
Favoritenstraße 9–11
1040 Wien

Room: HA 03 10 (how to get there)
Phone: +43 (1) 58801 – 184 09

Latest News

FORSYTE’s 2018 paper awards

FORSYTE has had a quite successful year: Adrian Rebola Pardo and his co-authors received the IJCAR best paper award for their paper Extended Resolution Simulates DRAT, Mitra Tabaei Befrouei and her co-authors received an OOPSLA 2018 Distinguished Paper award for their paper Randomized Testing of Distributed Systems with Probabilistic Guarantees, and Thomas Pani received the […]

Continue reading

OOPSLA Distinguished Paper Award

Mitra Tabaei Befrouei and her co-authors from MPI-SWS Burcu Kulahcioglu Ozkan, Rupak Majumdar, and Filip Niksic, received an OOPSLA’18 Distinguished Paper Award for their contribution “Randomized Testing of Distributed Systems with Probabilistic Guarantees” (Open Access article). Congratulations!

Continue reading

Zvonimir Rakamiric visiting FORSYTE

Prof. Zvonimir Rakamiric from the School of Computing at the University of Utah is spending his sabbatical with the FORSYTE group at TU Wien. He is generously sponsored by the Wolfgang Pauli Institute and a Pauli Fellow.

Continue reading

Full news archive