We present PuLP, a parallel and memory-efficient graph partitioning method specifically
designed to partition low-diameter networks with skewed degree distributions. Graph …

We study decision problems for parameterized verification of a formal model of Ad Hoc
Networks with selective broadcast and spontaneous movement. The communication …

We investigate the impact of dynamic topology reconfiguration on the complexity of
verification problems for models of protocols with broadcast communication. We first …

This paper analyzes the reflections of an agile team, develo** a large-scale project in an
industry setting. The team uses an iteration summary meeting practice, which includes four …

Gorrieri and Martinelli's timed Generalized Non-Deducibility on Compositions (tGNDC)
schema is a well-known general framework for the formal verification of security protocols in …

We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks
(MANETs) and their protocols. In our algebra we model the essential modeling concepts of …

We propose a timed broadcasting process calculus for wireless systems where time-
consuming communications are exposed to collisions. The operational semantics of our …

We investigate the impact of node and communication failures on the decidability and
complexity of parametric verification of a formal model of ad hoc networks. We start by …

In protocol development for wireless systems, the choice of appropriate mobility models
describing the movement patterns of devices has long been recognised as a crucial factor …

A prominent source of complexity in the verification of ad hoc network (AHN) protocols is the
fact that the number of network topologies grows exponentially with the square of the …