Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/83503
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHorne, Rossen
dc.contributor.authorMauw, Sjoukeen
dc.contributor.authorTiu, Alwenen
dc.date.accessioned2017-06-16T04:23:06Zen
dc.date.accessioned2019-12-06T15:24:23Z-
dc.date.available2017-06-16T04:23:06Zen
dc.date.available2019-12-06T15:24:23Z-
dc.date.issued2016en
dc.identifier.citationHorne, R., Mauw, S., & Tiu, A. (2017). Semantics for Specialising Attack Trees based on Linear Logic. Fundamenta Informaticae, 153(1-2), 57-86.en
dc.identifier.issn0169-2968en
dc.identifier.urihttps://hdl.handle.net/10356/83503-
dc.description.abstractAttack trees profile the sub-goals of the proponent of an attack. Attack trees have a variety of semantics depending on the kind of question posed about the attack, where questions are captured by an attribute domain. We observe that one of the most general semantics for attack trees, the multiset semantics, coincides with a semantics expressed using linear logic propositions. The semantics can be used to compare attack trees to determine whether one attack tree is a specialisation of another attack tree. Building on these observations, we propose two new semantics for an extension of attack trees named causal attack trees. Such attack trees are extended with an operator capturing the causal order of sub-goals in an attack. These two semantics extend the multiset semantics to sets of series-parallel graphs closed under certain graph homomorphisms, where each semantics respects a class of attribute domains. We define a sound logical system with respect to each of these semantics, by using a recently introduced extension of linear logic, called MAV, featuring a non-commutative operator. The non-commutative operator models causal dependencies in causal attack trees. Similarly to linear logic for attack trees, implication defines a decidable preorder for specialising causal attack trees that soundly respects a class of attribute domains.en
dc.description.sponsorshipNRF (Natl Research Foundation, S’pore)en
dc.description.sponsorshipMOE (Min. of Education, S’pore)en
dc.format.extent26 p.en
dc.language.isoenen
dc.relation.ispartofseriesFundamenta Informaticaeen
dc.rights© 2016 IOS Press and the authors. This is the author created version of a work that has been peer reviewed and accepted for publication by Fundamenta Informaticae, IOS Press and the authors. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [https://dx.doi.org/10.3233/FI-2017-1531].en
dc.subjectSemanticsen
dc.subjectAttack treesen
dc.titleSemantics for Specialising Attack Trees based on Linear Logicen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Science and Engineeringen
dc.identifier.doi10.3233/FI-2017-1531en
dc.description.versionAccepted versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:SCSE Journal Articles
Files in This Item:
File Description SizeFormat 
main.pdf712.94 kBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 20

22
Updated on Jan 22, 2023

Web of ScienceTM
Citations 20

9
Updated on Jan 29, 2023

Page view(s)

233
Updated on Feb 1, 2023

Download(s) 20

219
Updated on Feb 1, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.