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

Two papers at POPL’17

Two papers co-authored by researchers from our group have been accepted for POPL’17: “Coming to Terms with Quantified Reasoning” by Simon Robillard, Andrei Voronkov, and Laura Kovacs; and “A Short Counterexample Property for Safety and Liveness Verification of Fault-tolerant Distributed Algorithms” by Igor Konnov, Marijana Lazic, Helmut Veith, and Josef Widder

Continue reading

Helmut Veith Stipend

Outstanding female students in the field of computer science who pursue (or plan to pursue) one of the master‘s programs in Computer Science at TU Wien taught in English are invited to apply for the Helmut Veith Stipend

Continue reading

LogicLounge in memoriam Helmut Veith

Will robots take away your job? In memory of Helmut Veith, this year’s Conference on Computer Aided Verification (CAV), which takes place in Toronto, will feature a LogicLounge on the effect of automation and artificial intelligence on our jobs.

Continue reading

Questions answered by Leslie Lamport

Leslie Lamport is going to answer questions about a Mathematical View of Computer Systems in Informatikhörsaal on Tuesday at 6pm. Check the announcement at the VCLA website and do not forget to watch the lecture beforehand.

Continue reading

Full news archive