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

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