FM 2012 Accepted Papers

Hossein Hojjat, Filip Konecny, Florent Garnier, Radu Iosif, Viktor Kuncak and Philipp Ruemmer. A Verification Toolkit for Numerical Transition Systems (Tool Paper)

Maurice H. Ter Beek, Franco Mazzanti and Aldi Sulova. VMC: A Tool for Product Variability Analysis

Julien Dormoy, Olga Kouchnarenko and Arnaud Lanoix. Structural Refinement of Components Keeps Temporal Properties over Reconfigurations

Shang-Wei Lin, Yang Liu, Jun Sun, Jin Song Dong and Étienne André. Automatic Compositional Verification of Timed Systems

Truong Khanh Nguyen, Jun Sun, Yang Liu, Jin Song Dong and Yan Liu. Improved BDD-based Discrete Analysis of Timed Systems

Mirko Spasic and Filip Maric. Formalization of Incremental Simplex Algorithm by Stepwise Refinement

Nicolas D'Ippolito, Victor Braberman, Nir Piterman and Sebastian Uchitel. The Modal Transition System Control Problem

Virginia Aponte, Pierre Courtieu, Yannick Moy and Marc Sango. Maximal and Compositional Pattern-Based Loop Invariants

Soufiene Benkirane, Rachel Norman, Erin Scott and Carron Shankland. Measles Epidemics and PEPA: an exploration of historic disease dynamics using process algebra

Daniel Plagge and Michael Leuschel. Validating B,Z and TLA+ using ProB and Kodkod

Evren Ermis, Martin Schäf and Thomas Wies. Error Invariants

David Lazar, Andrei Arusoaie, Traian Serbanuta, Chucky Ellison, Dorel Lucanu and Grigore Rosu. Executing Formal Semantics with the K Tool

Andreas Bauer and Ylies Falcone. Decentralised LTL monitoring without central observer

Yasuhiko Minamide and Shunsuke Mori. Reachability Analysis of the HTML5 Parser Specification and its Application to Compatibility Testing

Étienne André, Laurent Fribourg, Ulrich Kühne and Romain Soulat. IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems

Denis Cousineau, Damien Doligez, Leslie Lamport, Stephan Merz and Daniel Ricketts. TLA+ Proofs

Maria Christakis, Peter Müller and Valentin Wüstholz. Collaborative Verification and Testing with Explicit Assumptions

Yael Meller, Orna Grumberg and Karen Yorav. Applying Software Model Checking Techniques For Behavioral UML Models

Ammar Osaiweran, Tom Fransen, Jan Friso Groote and Bart van Rijnsoever. Experience Report on Designing and Developing Control Components using Formal Methods

María Alpuente, Demis Ballis, Francisco Frechina and Daniel Romero. Julienne: a Trace Slicer for Conditional Rewrite Theories

Hengjun Zhao, Naijun Zhan, Deepak Kapur and Kim G. Larsen. A "Hybrid" Approach for Synthesizing Optimal Controllers of Hybrid Systems: A Case Study of the Oil Pump Industrial Example

Taylor T Johnson, Jeremy Green, Sayan Mitra, Rachel Dudley and Richard Scott Erwin. Satellite Rendezvous and Conjunction Avoidance: Case Studies in Verification of Nonlinear Hybrid Systems

Fu Song and Tayssir Touili. Efficient Malware Detection Using Model-Checking

Rob Hierons, Mercedes Merayo and Manuel Nuñez. Using Time to Add Order to Distributed Testing

Howard Barringer, Yliès Falcone, Klaus Havelund, Giles Reger and David Rydeheard. Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors

James Heather and Steve Schneider. A Formal Framework for Modelling Coercion Resistance and Receipt Freeness

Fides Aarts, Faranak Heidarian, Harco Kuppens, Petur Olsen and Frits Vaandrager. Automata Learning Through Counterexample-Guided Abstraction Refinement

Srinivas Nedunuri, William R Cook and Douglas Smith. Theory and Techniques for a Class of Space-Efficient Breadth-First Search Algorithms

German Sibay, Sebastian Uchitel, Victor Braberman and Jeff Kramer. Distribution of Modal Transition Systems

Grigore Rosu and Andrei Stefanescu. From Hoare Logic to Matching Logic

Guowei Yang, Sarfraz Khurshid and Miryung Kim. Specification-based Test Repair Using a Lightweight Formal Method

Sam Owre, Indranil Saha and Natarajan Shankar. Automatic Dimensional Analysis of Cyber-Physical Systems

Mikael Asplund, Atif Manzoor, Melanie Bouroche, Siobhan Clarke and Vinny Cahill. A Formal Approach to Autonomous Vehicle Coordination

Mathieu Giorgino and Martin Strecker. Correctness of pointer manipulating algorithms illustrated by a verified BDD construction

Matthieu Carlier, Catherine Dubois and Arnaud Gotlieb. A certified constraint solver over finite domains

- FM2012-CFP.pdf

- Poster FM2012.pdf

Scope
FM 2012 is the eighteenth in a series of symposia organized by Formal Methods Europe, an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. The symposia have been notably successful in bringing together innovators and practitioners in precise mathematical methods for software and systems development, industrial users as well as researchers. Submissions are welcomed in the form of original papers on research and industrial experience, proposals for workshops and tutorials, entries for the exhibition of software tools and projects, and reports on ongoing doctoral work.

The FM 2012 Symposium will be based around the theme
Interdisciplinary Formal Methods

It will have the goal of highlighting the development and application of formal methods in connection with a variety of disciplines such as medicine, biology, human cognitive modelling, human automation interactions and aeronautics, among others.
FM 2012 particularly welcomes papers on techniques, tools and experiences in interdisciplinary frameworks, as well as on experience with practical applications of formal methods in industrial and research settings, experimental validation of tools and methods as well as construction and evolution of formal methods tools.

The broad topics of interest for FM 2012 include but are not limited to:

Interdisciplinary formal methods: techniques, tools and experiences demonstrating formal methods in interdisciplinary frameworks; we encourage submissions involving formal methods related to maintenance, human automation interaction, human in the loop, system engineering, medicine and biology.
Formal methods in practice: industrial applications of formal methods, experience with introducing formal methods in industry, tool usage reports, experiments with challenge problems. Authors are encouraged to explain how the use of formal methods has overcome problems, lead to improvements in design or provided new insights.
Tools for formal methods: advances in automated verification and model-checking, integration of tools, environments for formal methods, experimental validation of tools. Authors are encouraged to demonstrate empirically that the new tool or environment advances the state of the art.
Role of formal methods in software and systems engineering: development processes with formal methods, usage guidelines for formal methods, method integration. Authors are encouraged to demonstrate that process innovations lead to qualitative or quantitative improvements.
Theoretical foundations: all aspects of theory related to specification, verification, refinement, and static and dynamic analysis. Authors are encouraged to explain how their results contribute to the solution of practical problems with methods or tools.
Teaching formal methods: original contributions that provide insight, evaluations and suggestions for courses of action regarding the teaching of formal methods, including teaching experiences, educational resources, the integration of formal methods into the curriculum, the definition of a formal methods body of knowledge, etc. Authors are encouraged to provide some form of evaluation and assessment of the content and approach in the teaching being reported.

Paper Submission
Papers will be evaluated by at least three members of the Programme Committee. They should be in Springer LNCS format and describe, in English, original work that has not been published or submitted elsewhere.
PDF versions of papers should be submitted through the FM 2012 EasyChair web site:
https://www.easychair.org/account/signin.cgi?conf=fm2012
We solicit two categories of papers:

Regular papers not exceeding 15 pages (including appendices), describing fully developed work. Authors of papers reporting experimental work are strongly encouraged to make their experimental results available for use by reviewers. Similarly, case study papers should describe significant case studies and the complete development should be made available for use by reviewers.
Tools papers of a maximum of 4 pages should describe an operational tool and its contributions; 2 additional pages of appendices are allowed that will not be included in the proceedings. Tool papers should explain enhancements made compared to previously published work. A tool paper need not present the theory behind the tool but can focus more on its features, and how it is used, with screen shots and examples. Authors of tools papers should make their tool available for use by reviewers.

Publication
Accepted papers will be published in the Symposium Proceedings, to appear in Springer's Lectures Notes in Computer Science.

Important dates:
Submission: March 5th, 2012
Notification: May 7th, 2012
Camera ready: June 4th, 2012