A Formalisation of Finite Automata in Isabelle/HOL

Add to your list(s) Download to your calendar using vCal

• Thomas Tuerk (University of Cambridge)
• Tuesday 23 October 2012, 13:00-14:00
• Computer Laboratory, William Gates Building, Room SS03.

If you have a question about this talk, please contact William Denman.

This talk has been canceled/deleted

As part of the CAVA project (http://cava.in.tum.de), I developed a library for finite automata in Isabelle/HOL. This library provides high-level, abstract definitions as well as low-level, executable ones. The first part of this talk will give an overview of this library. Then, a Presburger Arithmetic-case study will be used to demonstrate, how the library can be used. Finally, the implementation of Hopcroft’s algorithm will be discussed in detail.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.