Accepted papers & Program
Find the full program on
Download the pre-prints of the proceedings on
- Automated deductive verification for Ladder programming - Denis Cousineau, David Mentré and Hiroaki Inoue
- An Integrated Development Environment for the Prototype Verification System - Paolo Masci and Cesar Munoz
- A component-based formal language workbench - Peter Mosses
- Experience Report: Towards Moving Things with Types - Helping Logistics Domain Experts to Control Cyber-Physical Systems with Type-Based Synthesis - Jan Bessai, Moritz Roidl and Anna Vasileva
- Tool Support for Validation of Formal System Models: Interactive Visualization and Requirements Traceability - Eduard Kamburjan and Jonas Stromberg
- The TLA+ Toolbox - Markus Alexander Kuppe
- Simulation under arbitrary temporal logic constraints - Julien Brunel, David Chemouil, Alcino Cunha and Nuno Macedo
- Deeply Integrating C11 Code Support into Isabelle/PIDE - Frédéric Tuong and Burkhart Wolff
High levels of safety, security and also privacy standards require the use of formal methods to specify and develop compliant software (sub)systems. Any standard comes with an assessment process, which requires a complete documentation of the application to ease the justification of design choices and the review of code and proofs.
Ideally, an F-IDE dedicated to such developments should comply with several requirements. The first one is to associate a logical theory with a programming language, in a way that facilitates the tightly coupled handling of specification properties and program constructs. The second is to offer a language/environment simple enough to be usable by most developers, even if they are not fully acquainted with higher-order logics or set theory, in particular by making development of proofs as easy as possible. The third is to offer automated management of application documentation. It may also be expected that developments done with such an F-IDE are reusable and modular. Tools for testing and static analysis may be embedded within F-IDEs to support the assessment process.
The workshop is open to contributions on all aspects of a system development process, including specification, design, implementation, analysis and documentation. It welcomes the presentation of tools, methods, techniques and experiments. Topics of interest include, but are not limited to, the following:
- F-IDE building: design and integration of languages, development of user-friendly front-ends
- How to make high-level logical and programming concepts palatable to industrial developers
- Integration of Object-Oriented and modularity features
- Integration of static analyzers
- Integration of automatic proof tools, theorem provers and testing tools
- Documentation tools
- Impact of tools on certification
- Experience reports on developing F-IDEs
- Experience reports on using F-IDEs
- Experience reports on formal methods-based assessments in industrial applications
Keynote: What is KeY's key to software verification?
- Wolfgang Ahrendt, Chalmers University of Technology, Sweden
KeY is a deductive software verification approach and system, whose most elaborate version targets Java programs. In a recent KeY case study, which attracted attention also outside formal method circles, verification with KeY could reveal a bug in the main sorting routine of OpenJDK. While this talk will also cover the user interface of KeY, the focus of the discussion is more fundamental. KeY follows to a significant extent principles which are different from other deductive verification systems, on the level of the program logic, the proof calculus, the interaction with the prover, the transparency of proofs, and the usage of back-end solvers. In this talk, I will discuss the impact of these aspects, with a special focus on usability. In addition, we will look at how the design of the logic and calculus influenced the integration with other validation techniques, like test generation and runtime verification.
Wolfgang Ahrendt is professor at Chalmers University of Technology in Gothenburg, Sweden. He obtained his Ph.D. in Computer Science at the University of Karlsruhe in 2001. His work focuses on topics related to deductive software verification. He is one of the people behind the source code level verification approach and tool called KeY, and co-published the recent ‘KeY book’. Among others, he also worked on compositional verification of distributed objects, on combining static and runtime verification, and lately on smart contract verification. He is PC co-chair of the iFM conference, December 2019.
- Abstract submission:
June 18, 2019Extended July 2, 2019
- Paper submission:
June 25, 2019Extended July 9, 2019
- Notification: August 20, 2019
- Camera-ready version: September 3, 2019
- Workshop date: October 7, 2019
- Rosemary Monahan, Maynooth University, Ireland, rosemary (dot) monahan (at) nuim (dot) ie
- Virgile Prevosto, Institut List, CEA Tech, Université Paris-Saclay, France, virgile (dot) prevosto (at) cea (dot) fr
- José Proença, CISTER/ISEP and HASLab/INESC-TEC, Portugal, jose (dot) p (dot) proenca (at) inesctec (dot) pt
- Catherine Dubois, Samovar / ENSIIE, catherine (dot) dubois (at) ensiie (dot) fr
- Paolo Masci, US National Institute of Aerospace (NIA), paolo (dot) masci (a) nianet (dot) org
- Dominique Méry, LORIA / Université de Lorraine, dominique (dot) mery (at) loria (dot) fr
- Cinzia Bernardeschi (University of Pisa)
- José Creissac Campos (University of Minho)
- Paul Curzon (Queen Mary University of London)
- Damien Doligez (Inria)
- Andrea Domenici (University of Pisa)
- Carlo A. Furia (Chalmers University of Technology)
- Kenneth Lausdahl (Aarhus University)
- Stephan Merz (Inria Nancy)
- Stefan Mitsch (Carnegie Mellon University)
- Yannick Moy (Adacore)
- Andrei Paskevich (Université Paris-Sud, LRI)
- François Pessaux (ENSTA ParisTech)
- James Power (Maynooth University)
- Steve Reeves (University of Waikato)
- Bernhard Rumpe (RWTH Aachen University)
- Claudio Sacerdoti-Cohen (University of Bologna)
- Silvia Lizeth Tapia Tarifa (University of Oslo)
- Mattias Ulbricht (Karlsruhe Institute of Technology)
- Laurent Voisin (Systerel)
- Makarius Wenzel (sketis.net)
- Yi Zhang (U.S. Food and Drug Administration)
Submission guidelines & proceedings
Submitted papers will follow the FM 2019 Format and Submission Guidelines. Authors are invited to submit the following types of contributions:
- Research papers providing new concepts and results
- Experience reports
- Position papers and research perspectives
- Tool presentations
Submissions can be made through EasyChair: https://easychair.org/conferences/?conf=fide2019.
Two kinds of submissions will be considered: normal paper (15 pages including bibliography), and shorter papers describing work in progress and preliminary results (6 pages including bibliography).
Submitted papers should follow EPTCS format (http://style.eptcs.org/).
All papers will be peer-reviewed by at least two members of the program committee. They must describe original contributions whose main results and conclusions have not been published or submitted elsewhere. Preliminary proceedings, including all the papers selected for the workshop, will be available electronically at the workshop. Post proceedings will be proposed for publication with Electronic Proceedings in Theoretical Computer Science (EPTCS).