Zobrazeno 1 - 10
of 54
pro vyhledávání: '"DI LUNA, GIUSEPPE ANTONIO"'
In this paper we investigate the problem of searching for a black hole in a dynamic graph by a set of scattered agents (i.e., the agents start from arbitrary locations of the graph). The black hole is a node that silently destroys any agent visiting
Externí odkaz:
http://arxiv.org/abs/2404.15132
In recent years, binary analysis gained traction as a fundamental approach to inspect software and guarantee its security. Due to the exponential increase of devices running software, much research is now moving towards new autonomous solutions based
Externí odkaz:
http://arxiv.org/abs/2303.11143
Publikováno v:
Proceedings of ASPLOS 2023 - 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems
The availability of debug information for optimized executables can largely ease crucial tasks such as crash analysis. Source-level debuggers use this information to display program state in terms of source code, allowing users to reason on it even w
Externí odkaz:
http://arxiv.org/abs/2211.09568
Publikováno v:
In Theoretical Computer Science 2 February 2025 1025
Publikováno v:
In Journal of Parallel and Distributed Computing February 2025 196
Autor:
Di Luna, Giuseppe Antonio, Italiano, Davide, Massarelli, Luca, Osterlund, Sebastian, Giuffrida, Cristiano, Querzoni, Leonardo
Despite the advancements in software testing, bugs still plague deployed software and result in crashes in production. When debugging issues -- sometimes caused by "heisenbugs" -- there is the need to interpret core dumps and reproduce the issue offl
Externí odkaz:
http://arxiv.org/abs/2011.13994
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 hole BH, a harmful site that destroys all incoming agents without leaving
Externí odkaz:
http://arxiv.org/abs/2005.07453
Autor:
Di Luna, Giuseppe Antonio, Flocchini, Paola, Santoro, Nicola, Viglietta, Giovanni, Yamauchi, Yukiko
We investigate computational issues in the distributed model Amoebots of programmable matter. In this model, the computational entities, called particles, are anonymous finite-state machines that operate and move on an hexagonal tasselation of the pl
Externí odkaz:
http://arxiv.org/abs/2002.03384
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 correct process proposes an element $e$ of a certain join-semi lattice $L$
Externí odkaz:
http://arxiv.org/abs/2001.02670
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 likely be assigned by a human reverse engineer. We formally and precisely
Externí odkaz:
http://arxiv.org/abs/1912.07946