Dear Reader, The MoVES project on Modelling, Verification and Evolution of Software is sponsored by the Belgian government with its “Interuniversity Attraction Poles” (IAP) Programme which aims at providing support for teams of excellence in basic research that belong to Belgium’s various (linguistic) Communities. These teams work as part of a network in order to increase their joint contributi...

Mobile applications and on-body devices are becoming increasingly ubiquitous tools for physical activity tracking. We propose utilizing a self-tracker’s habits to support continuous prediction of whether they will reach their daily step goal, thus enabling a variety of potential persuasive interventions. Our aim is to improve the prediction by leveraging historical data and other qualitative (m...

The traditional edit-distance problem is to find the minimum number of insert-character and delete-character (and sometimes change character) operations required to transform one string into another. Here we consider the more general problem of a string represented by a singly linked list (one character per node) and being able to apply these operations to the pointer associated with a vertex a...

this comment argues that instead of worrying about the pros and cons of whistleblowing one should focus on the more general problem of the failure of upward communication around safety and quality problems and consider what leaders and managers must do to stimulate subordinates to communicate and reward such communication. the article analyzes why safety failures occur and introduces the concep...

Dear reader, This here is the third installment of the Fundamental Issues in Modelling, Verification and Evolution of Software (MoVES) newsletter. The goal of the newsletter is to highlight the work performed in the context of the project through the different workpackages. As with previous issues, this edition of the newsletter is divided in two parts, the first one focusing on the results ach...

T concept of dominance among nodes of a branch-and-bound tree, although known for a long time, is typically not exploited by general-purpose mixed-integer linear programming (MILP) codes. The starting point of our work was the general-purpose dominance procedure proposed in the 1980s by Fischetti and Toth, where the dominance test at a given node of the branch-and-bound tree consists of the (po...