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, Vienna University of Technology.
[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: ta.etysrofnull@inap
Web: http://forsyte.at/~pani/

Latest News

Winter School on Verification

The Austrian Society for Rigorous Systems Engineering (ARiSE) and the Vienna Center for Logic and Algorithms (VCLA) are organizing a joint winter school on verification at Vienna University of Technology from 6-10 February 2012. Apart from ARiSE/VCLA students, the school will be open to outside students. Details are available from the VCLA website.

Continue reading

CfP: Workshop on Exploiting Concurrency Efficiently and Correctly (EC^2 2010)

The annual Workshop on Exploiting Concurrency Efficiently and Correctly (EC2) is a forum that brings together researchers working on formal methods for concurrency, and those working on advanced parallel applications. Its goal is to stimulate incubation of ideas leading to future concurrent system design an verification tools that are essential in the multi-core era.

Continue reading

Full news archive