University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > A Formalisation of Finite Automata in Isabelle/HOL

A Formalisation of Finite Automata in Isabelle/HOL

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

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

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 was originally sheduled for 23rd October 2012, but cancelled due to illness.

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2018 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity