Formal specification tools for test coverage analysis

Abstract

This paper describes a prototype software tool that supports analyses for 21 structural coverage criteria. Formal techniques were developed for axiomatizing Ada and translating the path expressions of subprogram bodies into conjunctive normal form for use in a resolution-refutation theorem prover to determine feasibility. Coverage specifications were combined with feasible path construct a minimal specifications. These methods proved effective for small subprograms written in a restricted subset of the Ada language. This work laid the groundwork for subsequent research into automating test generation and coverage determination. Directions for future research are outlined and briefly discussed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>