• Publications
  • Influence
A survey of autonomic communications
tl;dr
Autonomic communications seek to improve the ability of network and services to cope with unpredicted change, including changes in topology, load, task, the physical and logical characteristics of networks that can be accessed, and so forth. Expand
  • 667
  • 30
  • Open Access
Exptime Tableaux for ALC
tl;dr
Abstract The last years have seen two major advances in Knowledge Representation and Reasoning. Expand
  • 163
  • 14
  • Open Access
Modeling security requirements through ownership, permission and delegation
tl;dr
Security requirements engineering is emerging as a branch of software engineering, spurred by the realization that security must be dealt with early on during the requirements phase. Expand
  • 247
  • 13
  • Open Access
Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL
tl;dr
This paper presents a tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of different techniques such as prefixed tableaux for modal logics and model checkers for μ-calculus. Expand
  • 96
  • 13
  • Open Access
Requirements Engineering Meets Trust Management: Model, Methodology, and Reasoning
tl;dr
This paper presents a formal framework for modeling and analyzing security and trust requirements at an organizational level. Expand
  • 102
  • 9
  • Open Access
Strongly Analytic Tableaux for Normal Modal Logics
  • F. Massacci
  • Mathematics, Computer Science
  • CADE
  • 26 June 1994
tl;dr
A strong analytic tableau calculus is presentend for the most common normal modal logics. Expand
  • 98
  • 9
Comparing Vulnerability Severity and Exploits Using Case-Control Studies
tl;dr
We propose using a case-control study methodology similar to the procedure used to link lung cancer and smoking in the 1950s to evaluate the relation between some risk factor (e.g., smoking) and an effect of exploiting a vulnerability. Expand
  • 91
  • 8
  • Open Access
Single Step Tableaux for Modal Logics
  • F. Massacci
  • Computer Science, Mathematics
  • Journal of Automated Reasoning
  • 1 April 2000
tl;dr
The paper presents a number of the computational results about SST (confluence, decidability, space complexity, modularity, etc.) and compares SST with other formalisms such as translation methods, modal resolution, and Gentzen-type tableaux. Expand
  • 81
  • 8
  • Open Access
StaDynA: Addressing the Problem of Dynamic Code Updates in the Security Analysis of Android Applications
tl;dr
Static analysis of Android applications can be hindered by the presence of the popular dynamic code update techniques: dynamic class loading and reflection. Expand
  • 77
  • 6
  • Open Access
Verifying security protocols as planning in logic programming
tl;dr
We illustrate ALSP (Action Language for Security Protocol), a declarative executable specification language for planning attacks to security protocols. Expand
  • 83
  • 6
  • Open Access