Institute for Computer Languages
Compilers and Languages Group

Symbolic Computation and Theorem Proving for Verified Software

The tutorial will present several symbolic computation, invariant generation and theorem proving methods and tools. By the end of the tutorial, participants will have a better understanding in choosing the appropriate methodology for their specific application.

The tutorial is meant for graduate and undergraduate students, as well as for more experienced researchers in the field of formal methods and symbolic computation.


This tutorial will be co-located with the SYNASC 2011 conference, Timisoara, Romania.

The tutorial will be organised as a series of four connected tutorial sessions. Each of the tutorial sessions will be of half a day. Tutorial sessions will overview foundations and challenges, describe available tool support for various theoretical frameworks, and comprise of an interleaving of tool presentations and labs. The lab sessions will give the attendees an opportunity to get some hands on experience with the presented tools.



The tutorial will be of 2 days and will take place between 27-28 September, during the SYNASC 2011 conference.

The tutorial will comprise of four sessions, as follows:

Laura Kovács
Faculty of Informatics
Vienna University of Technology
top | HTML 4.01 | last update: 2015-02-20 (Webmaster)