• Publications
  • Influence
Transformations of CLP Modules
We propose a transformation system for CLP programs and modules. The framework is inspired by the one of Tamaki and Sato for pure logic programs. However, the use of CLP allows us to introduce someExpand
  • 94
  • 17
LKHW: a directed diffusion-based secure multicast scheme for wireless sensor networks
In this paper, we present a mechanism for securing group communications in Wireless Sensor Networks (WSN). First, we derive an extension of logical key hierarchy (LKH). Then we merge the extensionExpand
  • 157
  • 11
An Improved Constraint-Based System for the Verification of Security Protocols
We propose a constraint-based system for the verification of security protocols that improves upon the one developed by Millen and Shmatikov [30]. Our system features (1) a significantly moreExpand
  • 116
  • 11
POSEIDON: a 2-tier anomaly-based network intrusion detection system
We present POSEIDON, a new anomaly-based network intrusion detection system. POSEIDON is payload-based, and has a two-tier architecture: the first stage consists of a self-organizing map, while theExpand
  • 112
  • 7
On the Unification Free Prolog Programs
We provide simple conditions which allow us to conclude that in case of several well-known Prolog programs the unification algorithm can be replaced by iterated matching. The main tools used here areExpand
  • 75
  • 6
N-Gram against the Machine: On the Feasibility of the N-Gram Network Analysis for Binary Protocols
In recent years we have witnessed several complex and high-impact attacks specifically targeting "binary" protocols (RPC, Samba and, more recently, RDP). These attacks could not be detected byExpand
  • 78
  • 5
Timed model checking of security protocols
We propose a method for engineering security protocols that are aware of timing aspects. We study a simplified version of the well-known Needham Schroeder protocol and the complete Yahalom protocol.Expand
  • 49
  • 5
Termination of Well-Moded Programs
We study the termination properties of well-moded programs, and we show that, under suitable conditions, for these programs there exists an algebraic characterization-in the style of Apt andExpand
  • 36
  • 5
LicenseScript: a novel digital rights language and its semantics
We propose LicenseScript as a new multiset rewriting/logic based language for expressing dynamic conditions of use of digital assets such as music, video or private data. LicenseScript differs fromExpand
  • 49
  • 4
Transforming Normal Programs by Replacement
The replacement transformation operation, already defined in [28], is studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation wrt Fitting's andExpand
  • 24
  • 3