A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
This tutorial deals with runtime enforcement which is an extension of runtime verification aiming to circumvent misbehaviors of systems. After an historical overview of previous a...
In this work, we consider Authentication and Key Agreement (AKA), a popular client-server Key Exchange (KE) protocol, commonly used in wireless standards (e.g., UMTS), and widely c...
The Student Contest on Software Engineering (SCORE), organized for the first time in conjunction with the International Conference on Software Engineering (ICSE) 2009, attracted 5...
Dino Mandrioli, Stephen Fickas, Carlo A. Furia, Me...
We report on how the Wrangler refactoring tool has been used to improve and transform test code for Erlang systems. This has been achieved through the removal of code clones, the i...