Sloopy

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

Downloads

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.

Publications

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

Contact

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

Room: HA 03 10 (how to get there)
Phone: +43 (1) 58801 – 184 09
Email: pani@forsyte.at
Web: http://forsyte.at/~pani/

Latest News

Jens Pagel wins Bill McCune PhD Award

We congratulate Jens Pagel for receiving the 2021 Bill McCune PhD Award in Automated Reasoning! Jens graduated in 2020; his thesis on Decision procedures for separation logic: beyond symbolic heaps (supervised by Florian Zuleger) presents his substantial contributions to the theory of formal verification and automated reasoning, and to verifying heap-manipulating programs in particular.

Continue reading

Full news archive