Ecole Polytechnique Fédérale de Lausanne
WING 2009
english only
ETAPS 2009
Home Committee Submission Registration Accepted Papers Program

Welcome to WING 2009!

Satellite Workshop of ETAPS 2009

Program verification has a long research tradition, but so far its impact on development of safety critical software has been relatively limited. A key impediment has been the overhead associated with providing and debugging auxiliary invariant annotations. As the design and implementation of reliable software remains an important issue, any progress in this area will be of utmost importance for future developments in IT.

The logically deep parts of the code are characterized by (nested) loops or recursions. For these parts, formal program verification is an appropriate tool. One of its biggest challenges is automated discovery of inductive assertions, leading to verification of safety and security properties of programs.

The increasing power of automated theorem proving and computer algebra has opened new perspectives for computer aided program verification; in particular for the automatic generation of inductive assertions in order to reason about loops and recursion. Especially promising breakthroughs are invariant generation techniques by Gröbner bases, quantifier elimination, and algorithmic combinatorics, which can be used in conjunction with model checking, theorem proving, static analysis and abstract interpretation.


This workshop aims to bring together researchers from several fields of abstract interpretation, computational logic and computer algebra to support reasoning about loops, in particular, by using algorithmic combinatorics, narrowing/widening techniques, static analysis, polynomial algebra, quantifier elimination and model checking.

We encourage submissions presenting work in progress, tools under development, as well as research of PhD students, such that the workshop can become a forum for active dialog between the groups involved in this new research area.

Relevant topics include (but are not limited to) the following:

  • Program analysis and verification
  • Inductive Assertion Generation
  • Inductive Proofs for Reasoning about Loops
  • Applications to Assertion Generation using the following tools:
    • Abstract Interpretation
    • Static Analysis
    • Model Checking
    • Theorem Proving
    • Algebraic Techniques
  • Tools for inductive assertion generation and verification
  • Alternative techniques for reasoning about loops


All submissions will be peer-reviewed by the programme committee. Accepted contributions will be published in archived electronic notes, as an EasyChair collection volume.

A special issue of the Journal of Symbolic Computation with full versions of selected papers will be published after the workshop.

Keynote Speakers

Program Chairs

Program Committee

Important Dates

January 19, 2009: Submission deadline
February 23, 2009: Notification of acceptance
March 2, 2009: Camera ready copy deadline
March 29, 2009: WING 2009 in York, UK

Page maintained by Laura Kovács.