Student Projects—Automated Reasoning

Dynamic Proof Search Visualisation

An automatic theorem prover such as Vampire, can generate millions of clauses when searching for a proof of a conjecture. The proof search process is usually documented by an output log, which however often becomes difficult to understand and analyze due to its sheer size. The aim of this project is to develop a visualisation tool for turning the output log into a graphical summary of the search with the ability to track the development in time. This will consist in devising various metrics for characterising the generated clauses thus mapping them to an Euclidean space, combined with a visualisation of the space using methods from computer graphics (2D, 3D).

[Contact Martin Suda]

Latest News

CAV 2013 in St. Petersburg!

Our group is co-organizing CAV 2013, the leading conference in computer-aided verification. The conference will take place July 13-19, 2013, during the famous White Nights in beautiful St. Petersburg.  

Continue reading

Florian Zuleger winning WWTF grant

Florian Zuleger was awarded a grant by WWTF for his research project “Automated Program Analysis for Bounds on Resource Consumption”. Florian’s project will develop new methods to extract bounds for loops, memory and bandwidth from imperative programs.

Continue reading

Welcome Georg Weissenbacher

Georg Weissenbacher, leader of a WWTF funded Vienna Research Group, will start his work in our group on July 2. His project “Heisenbugs: From Detection to Explanation” is applying formal methods to identify hard-to-detect errors in computer systems. See a newspaper article on his work in “Der Standard”.

Continue reading

Full news archive