Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/94324
Full metadata record
DC FieldValueLanguage
dc.date.accessioned2022-04-25T12:35:55Z-
dc.date.available2022-04-25T12:35:55Z-
dc.date.issued2012-
dc.identifier.citationMasini, J. (2012). Runtime verification of distributed systems (Bachelor’s dissertation).en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar/handle/123456789/94324-
dc.descriptionB.Sc. IT (Hons)(Melit.)en_GB
dc.description.abstractCorrectness verification of distributed systems poses a challenge when contrasted with monolithic systems. Due to the complexity of distributed architectures, traditional software verification techniques do not provide adequate coverage when applied over such systems, pertaining to the distributed nature of the global state. Amongst the various software verification techniques available, runtime verification is deemed a sound approach to evaluate the correctness of distributed systems. Runtime verification requires analysis of the target system's traces to evaluate the systems behaviour. In the case of distributed architectures, it proves challenging to extract a globally ordered trace, as a global clock is not available. Furthermore, distributed architecture retaining a dynamic topology may require monitors to adapt to locations unknown at runtime. Several monitoring strategies already exist to compensate for these issues. Gauci et al. proposed migrating monitors; a novel monitoring strategy for runtime verification of distributed systems. Monitors modelled over this strategy employ trace analysis locally and migrate to the respective location when requesting resources that are not available locally. This monitoring strategy, whilst reducing information exposure over communication mediums, is shown to be as effective as other monitoring approaches. Yet, an implementation of migrating monitors has never been carried out. To study this monitoring strategy, they presented an adaptation of distributed 'if-calculus, mDPI, which is expressive enough to model and reason about migrating monitors. This dissertation aims to show that the implementation of mDPI as a logic for runtime verification is achievable, and as a corollary, we show that a migrating monitor strategy is implementable for monitoring over a distributed framework. Using work in this area, a framework is designed and implemented which allows the necessary functionality to model the logic expressed in mDPI and achieve a migrating monitor strategy over a distributed setting.en_GB
dc.language.isoenen_GB
dc.rightsinfo:eu-repo/semantics/restrictedAccessen_GB
dc.subjectJava (Computer program language)en_GB
dc.subjectERLANG (Computer program language)en_GB
dc.subjectComputer software -- Verificationen_GB
dc.titleRuntime verification of distributed systemsen_GB
dc.typebachelorThesisen_GB
dc.rights.holderThe copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.en_GB
dc.publisher.institutionUniversity of Maltaen_GB
dc.publisher.departmentFaculty of Information and Communication Technologyen_GB
dc.description.reviewedN/Aen_GB
dc.contributor.creatorMasini, Joseph (2012)-
Appears in Collections:Dissertations - FacICT - 2012

Files in This Item:
File Description SizeFormat 
B.SC.(HONS)ICT_Masini_Joseph_2012.PDF
  Restricted Access
4.49 MBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.