{'fraction_non_alphanumeric': 0.01607717041800643, 'fraction_numerical': 0.001607717041800643, 'mean_word_length': 5.292929292929293, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Evaluation of WCET Analysis using Symbolic Loop Bounds

In this paper we evaluate a symbolic loop bound generation technique recently proposed by the authors in [7]. The technique deploys pattern-based recurrence solving in conjunction with program flow refinement using SMT reasoning. The derived bounds are further used in the WCET analysis of programs with loops. This paper presents experimental evaluations of the method carried out with the r-TuBound software tool. We evaluate our method against various academic and industrial WCET benchmarks, and outline further challenges for symbolic loop bound computation.