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

WWTF ICT project awarded to Igor Konnov

Igor Konnov (PI), together with Josef Widder (co-PI) and Helmut Veith (core team), are awarded an ICT research project APALACHE “Abstraction-based Parameterized TLA Checker” by the Vienna Science and Technology Fund WWTF.

Continue reading

Austrian Computer Science Day 2015

The Austrian Computer Science Day 2015, which takes place on October 15, features a range of talks by leading Austrian computer scientists, including topics such as computer games, augmented reality, aware systems, semantic web, business processes, and reliable systems. Register for free by October 7, 2015! This year’s speakers are: Alois Ferscha (JKU Linz) Tom […]

Continue reading

Helmut Veith receives CAV Award

The 2015 CAV Award is given to Edmund Clarke, Orna Grumberg, Ron Hardin, Zvi Harel, Somesh Jha, Robert Kurshan, Yuan Lu, and Helmut Veith for the development and implementation of the localization-reduction technique and the formulation of counterexample-guided abstraction refinement (CEGAR).

Continue reading

FRIDA’15

We had great talks at FRIDA’15 workshop in Grenoble. The slides of some of the talks are available online.

Continue reading

Full news archive