Please register on the central FM registration site.

Early registration is until September 10, 2019.

Conference Program

There are coffee breaks in the morning 10:00 - 10:30, lunch breaks 12:30 - 14:00, and coffee breaks in the afternoon 15:00 - 15:30 (Friday 15:30 - 16:00).

As social event (Thursday afternoon and evening) we will have an excursion to a Port-Wine cellar in Gaia for a Port-Wine tasting and in the evening join the congress banquet of the FM Week 2019 (more information).

The TAP program (also available at EasyChair) has several free slots that are meant to open the opportunity for TAP participants to attend the keynotes of other conferences of the FM Week 2019, see the program of the FM Week 2019 to assemble an exciting individual program.

Wednesday, October 9, 2019
14:00 - 15:00
Session chair:
Dirk Beyer
Extracting Unverified Program Parts from Software Verification Runs (Keynote)
Heike Wehrheim
15:30 - 17:00
Session chair:
Nikolai Kosmatov
Constraints in Dynamic Symbolic Execution: Bitvectors or Integers?
Timotej Kapus, Martin Nowack, and Cristian Cadar
Fast, Automatic, and Nearly Complete Structural Unit-Test Generation Combining Genetic Algorithms and Formal Methods
Eric Lavillonnière, David Mentré, and Denis Cousineau
Coverage-Based Testing with Symbolic Transition Systems
Petra van den Bos and Jan Tretmans
Thursday, October 10, 2019
10:30 - 12:00
Session chair:
Burkhart Wolff
BTestBox - A Tool for Testing B Translators and Coverage of B Models
Diego de Azevedo Oliveira, Valério Gutemberg Medeiros Jr, David Déharbe, and Martin A. Musicante
Predicting and Testing Latencies with Deep Learning: An IoT Case Study
Bernhard K. Aichernig, Franz Pernkopf, Richard Schumi, and Andreas Wurm
Learning Communicating State Machines
Alexandre Petrenko and Florent Avellaneda
13:00 - 14:00 Steering-Committee Meeting
Friday, October 11, 2019
10:30 - 12:30
Session chair:
Catherine Dubois
Repairing Timed-Automata Clock Guards through Abstraction and Testing
Étienne André, Paolo Arcaini, Angelo Gargantini, and Marco Radavelli
Proving a Non-Blocking Algorithm for Process Renaming with TLA+
Aurélie Hurault and Philippe Queinnec
Tame Your Annotations with MetAcsl: Specifying, Testing, and Proving High-Level Properties
Virgile Robles, Nikolai Kosmatov, Virgile Prevosto, Louis Rilling, and Pascale Le Gall
Property-Based Test-Case Generators for Free
Emanuele De Angelis, Fabio Fioravanti, Adrian Palacios, Alberto Pettorossi, and Maurizio Proietti
14:00 - 15:30
Session chair:
Chantal Keller
RoboStar Technology - Testing in Robotics Using Process Algebra (Invited Tutorial)
Ana Cavalcanti
16:00 - 17:00 Discussion and Good bye