Please use this identifier to cite or link to this item:
|Title:||PolyLARVA : runtime verification with configurable resource-aware monitoring boundaries|
Pace, Gordon J.
Computer programs -- Verification
Real-time data processing
Autonomous distributed systems
|Publisher:||Springer, Berlin, Heidelberg|
|Citation:||Colombo, C., Francalanza, A., Mizzi, R., & Pace, G. J. (2012). PolyLarva: runtime verification with configurable resource-aware monitoring boundaries. 10th International Conference on Software Engineering and Formal Methods, Thessaloniki. 218-232.|
|Abstract:||Runtime verification techniques are increasingly being applied in industry as a lightweight formal approach to achieve added assurance of correctness at runtime. A key issue determining the adoption of these techniques is the overheads introduced by the runtime checks, affecting the performances of the monitored systems. Despite advancements in the development of optimisation techniques lowering these overheads, industrial settings such as online portals present new challenges, since they frequently involve the handling of high volume transaction throughputs and cannot afford substantial deterioration in the service they provide. One approach to reduce overheads is the deployment of the verification computation on auxiliary computing resources, creating a boundary between the system and the verification code. This limits the use of system resources with resource intensive verification being carried out on the remote-side. However, under particular scenarios this approach may still not be ideal, as it may induce significant communication overheads. In this paper, we propose a framework which enables fine-tuning of the tradeoff between processing, memory and communication monitoring overheads, through the use of a user-configurable monitoring boundary. This approach has been implemented in the second generation of the LARVA runtime verification tool, polyLARVA.|
|Appears in Collections:||Scholarly Works - FacICTCS|
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.