25 citations · 76 across the 16 of their papers we have counts for
23 papers
Efficient Computation in Congested Anonymous Dynamic Networks
Giuseppe A. Di Luna, Giovanni Viglietta
An anonymous dynamic network is a network of indistinguishable processes whose communication links may appear or disappear unpredictably over time. Previous research has shown that…
Who is Debugging the Debuggers? Exposing Debug Information Bugs in Optimized Binaries
Giuseppe Antonio Di Luna, Davide Italiano, Luca Massarelli +3
Despite the advancements in software testing, bugs still plague deployed software and result in crashes in production. When debugging issues -- sometimes caused by "heisenbugs" --…
Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots
Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta +1
A swarm of anonymous oblivious mobile robots, operating in deterministic Look-Compute-Move cycles, is confined within a circular track. All robots agree on the clockwise direction…
Tight Bounds for Black Hole Search in Dynamic Rings
Giuseppe Antonio Di Luna, Paola Flocchini, Giuseppe Prencipe +1
In this paper, we start the investigation of distributed computing by mobile agents in dangerous dynamic networks. The danger is posed by the presence in the network of a black hol…
Mobile RAM and Shape Formation by Programmable Particles
Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro +2
We investigate computational issues in the distributed model Amoebots of programmable matter. In this model, the computational entities, called particles, are anonymous finite-stat…
Synchronous Byzantine Lattice Agreement in Rounds
Giuseppe Antonio Di Luna, Emmanuelle Anceaume, Silvia Bonomi +1
In the Lattice Agreement (LA) problem, originally proposed by Attiya et al. \cite{Attiya:1995}, a set of processes has to decide on a chain of a lattice. More precisely, each corre…
In Nomine Function: Naming Functions in Stripped Binaries with Neural Networks
Fiorella Artuso, Giuseppe Antonio Di Luna, Luca Massarelli +1
In this paper we investigate the problem of automatically naming pieces of assembly code. Where by naming we mean assigning to an assembly function a string of words that would lik…
Oblivious Permutations on the Plane
Shantanu Das, Giuseppe A. Di Luna, Paola Flocchini +3
We consider a distributed system of n identical mobile robots operating in the two dimensional Euclidian plane. As in the previous studies, we consider the robots to be anonymous,…
Byzantine Generalized Lattice Agreement
Giuseppe Antonio Di Luna, Emmanuelle Anceaume, Leonardo Querzoni
The paper investigates the Lattice Agreement (LA) problem in asynchronous systems. In LA each process proposes an element from a predetermined lattice, and has to decide on an…
Unsupervised Features Extraction for Binary Similarity Using Graph Embedding Neural Networks
Roberto Baldoni, Giuseppe Antonio Di Luna, Luca Massarelli +2
In this paper we consider the binary similarity problem that consists in determining if two binary functions are similar only considering their compiled form. This problem is know…
SAFE: Self-Attentive Function Embeddings for Binary Similarity
Luca Massarelli, Giuseppe Antonio Di Luna, Fabio Petroni +2
The binary similarity problem consists in determining if two functions are similar by only considering their compiled form. Advanced techniques for binary similarity recently gaine…
Patrolling on Dynamic Ring Networks
Shantanu Das, Giuseppe Antonio Di Luna, Leszek A. Gasieniec
We study the problem of patrolling the nodes of a network collaboratively by a team of mobile agents, such that each node of the network is visited by at least one agent once in ev…
TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro +1
In this paper we investigate the computational power of a set of mobile robots with limited visibility. At each iteration, a robot takes a snapshot of its surroundings, uses the sn…
Line-Recovery by Programmable Particles
Giuseppe Di Luna, Paola Flocchini, Giuseppe Prencipe +2
Shape formation has been recently studied in distributed systems of programmable particles. In this paper we consider the shape recovery problem of restoring the shape when of…
Shape Formation by Programmable Particles
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro +2
Shape formation is a basic distributed problem for systems of computational mobile entities. Intensively studied for systems of autonomous mobile robots, it has recently been inves…
Meeting in a Polygon by Anonymous Oblivious Robots
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro +2
The Meeting problem for searchers in a polygon (possibly with holes) consists in making the searchers move within , according to a distributed algorithm, in such a…
Gathering in Dynamic Rings
Giuseppe Antonio Di Luna, Paola Flocchini, Linda Pagli +3
The gathering problem requires a set of mobile agents, arbitrarily positioned at different nodes of a network to group within finite time at the same location, not fixed in advance…
Population Protocols with Faulty Interactions: the Impact of a Leader
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi +3
We consider the problem of simulating traditional population protocols under weaker models of communication, which include one-way interactions (as opposed to two-way interactions)…
On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols
Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi +3
In this paper we investigate the computational power of Population Protocols (PP) under some unreliable and/or weaker interaction models. More precisely, we focus on two features r…
Live Exploration of Dynamic Rings
Giuseppe Antonio Di Luna, Stefan Dobrev, Paola Flocchini +1
In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is event…
Investigating the Cost of Anonymity on Dynamic Networks
Giuseppe Antonio Di Luna, Roberto Baldoni
In this paper we study the difficulty of counting nodes in a synchronous dynamic network where nodes share the same identifier, they communicate by using a broadcast with unlimited…
Mutual Visibility by Luminous Robots Without Collisions
G. A. Di Luna, P. Flocchini, S. Gan Chaudhuri +3
Consider a finite set of identical computational entities that can move freely in the Euclidean plane operating in Look-Compute-Move cycles. Let p(t) denote the location of entity…
Robots with Lights: Overcoming Obstructed Visibility Without Colliding
G. A. Di Luna, P. Flocchini, S. Gan Chaudhuri +2
Robots with lights is a model of autonomous mobile computational entities operating in the plane in Look-Compute-Move cycles: each agent has an externally visible light which can a…