Alessandro Ferrante

Learn More
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit a power-law distribution: the number of nodes yi of a given degree i is proportional to i−β where β > 0 is a constant that depends on the application domain. There is practical(More)
IPSec is a suite of protocols that adds security to communications at the IP level. This suite of protocols is becoming more and more important as it is included as mandatory security mechanism in IPv6. In this paper we provide an evaluation of the hardware resources needed for supporting virtual private networking through IPSec. The target system of this(More)
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the standard quantifiers with graded modalities, being able thus to express “There exist at least k” or “For all but k” futures, for some constant k. One can thus describe properties(More)
IPSec is a suite of protocols which adds security to communications at the IP level. Protocols within the IPSec suite make extensive use of cryptographic algorithms. Since these algorithms are computationally very intensive, some hardware acceleration is needed to support high throughput. In this paper we propose a high level architecture of a system on(More)
The model checking problem for open systems has been widely studied in the literature, for both finite–state (module checking) and infinite–state (pushdown module checking) systems, with respect to CTL and CTL. In this paper, we further investigate this problem with respect to the μ-calculus enriched with nominals and graded modalities (hybrid graded(More)
In this paper we study optimization problems with verifiable one-parameter selfish agents introduced by Auletta et al. [ICALP 2004]. Our goal is to allocate load among the agents, provided that the secret data of each agent is a single positive real number: the cost they incur per unit load. In such a setting the payment is given after the load completion,(More)
The model checking problem for open systems (called module checking) has been intensively studied in the literature, both for finite–state and infinite–state systems. In this paper, we focus on pushdown module checking with respect to decidable fragments of the fully enriched μ–calculus. We recall that finite–state module checking with respect to fully(More)