Using assertions with traces

Assertions dynamic detection algorithms 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 dependences for software dependability increase. This article introduces techniques for increasing efficiency of detected assertions through using program execution trace. Conceptions of trace and assertion with trace were defined. The work describes methods of automatic assertion with trace detection and verification during program execution as well as algorithms for shortening traces and reducing number of observation points id’s in traces. For several applications experiments results have been presented.

Author: Piotr Nazimek
Conference: Title