![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 12 February 2013, 13:00-14:00
A Formalisation of Finite Automata in Isabelle/HOL
- 👤 Speaker: Thomas Tuerk (University of Cambridge)
- 📅 Date & Time: Tuesday 12 February 2013, 13:00 - 14:00
- 📍 Venue: Computer Laboratory, William Gates Building, Room SS03
Questions? Contact
William Denman
Abstract
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.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Automated Reasoning Group Lunches
- Computer Laboratory, William Gates Building, Room SS03
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.