#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2003

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alessandro Ferrante, Gopal Pandurangan, Kihong Park
- COCOON
- 2007

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)

- A. Ferrante, V. Piuri, J. Owen
- Next Generation Internet Networks, 2005
- 2005

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)

The use of the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a nonnegative integer k, has been thoroughly studied in various kinds of logics. In classical logic there are counting quantifiers, in modal logics graded modalities, in description logics number restrictions. Recently, the… (More)

- Alessandro Ferrante, Margherita Napoli, Mimmo Parente
- ICFEM
- 2009

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)

- A. Ferrante, V. Piuri
- 2007 Next Generation Internet Networks
- 2007

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)

- Alessandro Ferrante, Aniello Murano
- FoSSaCS
- 2007

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)

- Alessandro Ferrante, Aniello Murano, Mimmo Parente
- ArXiv
- 2008

- Alessandro Ferrante, Gennaro Parlato, Francesco Sorrentino, Carmine Ventre
- Theor. Comput. Sci.
- 2009

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)

- Alessandro Ferrante, Margherita Napoli, Mimmo Parente
- Fundam. Inform.
- 2009

Recently, complexity issues related to the decidability of the μ-calculus, when the universal and existential quantifiers are augmented with graded modalities, have been investigated by Kupfermann, Sattler and Vardi ([19]). Graded modalities refer to the use of the universal and existential quantifiers with the added capability to express the concept of at… (More)

- Alessandro Ferrante, Aniello Murano, Mimmo Parente
- LPAR
- 2007

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)