Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting

• Published in: Journal of logical and algebraic methods in programming Vol. 135; p. 100903
• Main Authors: Kojima, Misaki, Nishida, Naoki
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.10.2023
• Subjects: Constrained rewriting; Program transformation; Runtime-error verification; Runtime-error verification; Constrained rewriting; Program transformation
• ISSN: 2352-2208
• DOI: 10.1016/j.jlamp.2023.100903

A concurrent program with semaphore-based exclusive control can be modeled by a logically constrained term rewrite system. In this paper, we first propose a framework to reduce the non-occurrence of a specified runtime error in the program to an all-path reachability problem of the transformed logically constrained term rewrite system. Here, an all-path reachability problem of the system is a pair of state sets and is demonically valid if every finite execution path starting with a state in the first set and ending with a terminating state includes a state in the second set. Then, we propose a weakened but easily-implementable variant of an existing proof system for all-path reachability problems. As a case study, we deal with the race freedom of concurrent programs with semaphore-based exclusive control. •We propose a framework to reduce the non-occurrence of a specified runtime error in a program to an all-path reachability problem of an LCTRS.•We show how to apply the framework to the race freedom of concurrent programs with semaphore-based exclusive control.•We propose a weakened but easily-implementable variant of an existing proof system for all-path reachability problems.