EuroTcl Logo
Home
Registration
Currently selected Program
Accomodation
Travel
Past Events
Sponsors
Siemens Logo

Program

General information

There will be a come-together on Friday evening for those arriving in Berlin the day before the meeting.

Program Schedule

Friday
Time TBD Come Together
Saturday
Time TBD On-site registration, Meet and Greet
Welcome
Talks
Lunch
Talks
Time TBD Social Event
Sunday
Time TBD Meet and Greet
Talks
Lunch
Talks
Time TBD Conclusion, Goodbye

Talks and Presentations

Florian Murr
Florian Murr
McFSM - A Vast Extension to Finite State Machines

McFSM (Multiple coupled Finite State Machines) is a new theory and a new paradigm to create Finite State Maschines (FSMs) with huge state spaces.
This makes this new kind of FSMs practical in new areas, quite apart from their traditional use. What makes FSMs so appealing is the fact that their properties can be proven at compile-time. This is in contrast with Turing-complete code which has to resort to runtime-testing, because no proofs are possible at compile-time.
McFSMs greatly extend the applicability of FSMs into domains that were previously only accessible with Turing-complete code, while retaining most of the provability. McFSMs require a new theory, a DSL (Domain Specific Language) and an IDE (Integrated Development Environment).

The current prototype is a transpiler IDE written in TclOO and Tk, with persistent data-structures in SQLite, that generates code in various programming languages.
A paper about McFSM has been accepted for the ICSE-2017, with a preprint that can be found at http://arxiv.org/abs/1702.07951