Translator Disclaimer
Paper
11 September 2015 Using assertions with trace
Author Affiliations +
Proceedings Volume 9662, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2015; 96623M (2015) https://doi.org/10.1117/12.2205712
Event: XXXVI Symposium on Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments (Wilga 2015), 2015, Wilga, Poland
Abstract
Algorithms for dynamic detection of assertions are designed to find different types of dependences in programs based only on information collected during their execution without static analysis. Specificity of those algorithms and limited quantity of data to analyze needs to investigate the usage principle of discovered assertions for software dependability increase. This article introduces techniques for increasing usage efficiency of detected assertions through using program execution trace. Concept of trace and of an assertion with trace were defined. The work describes algorithms for reducing the number of traces, shortening traces lengths and reducing the number of observation points identifiers in traces. For several applications fault injection based experiments were conducted in order to check the effectiveness of the proposed approach.
© (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Piotr Nazimek "Using assertions with trace", Proc. SPIE 9662, Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2015, 96623M (11 September 2015); https://doi.org/10.1117/12.2205712
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
Back to Top