Compile-Time Analysis of Data List-Format List Correspondences

Abstract

Formatted input-output is available in a number of programming languages.In the most general case, the corresnondence between data items and format items cannot be determined during comoilation, and so it is determined dynamically during execution. However, in most oairs of data and format lists that occur in practice, determination of the correspondence is in fact possible during compilation. Although some commercial compilers make this determination, there is little published literature on the subject.In this paper, we briefly examine three areas in which compile-time determination of the data-format correspondence is useful: optimiaation , program validation, and automatic test data generation.A formalism for stating the problem is given, and a solution is discussed in terms of formal language theorv. Using this formalism, an algorithm for determining the correspondence is given, and its application is illustrated by examples in both PL/I and FORTRAN.

Automated Test Case Generator.

“…In the course of this project we have produced both Functional Descriptions and System/Subsystem Specifications for Automated Test Case Generators (ATCG) 1 to operate in two different (though similar) environments.…”

“…The three methods used to generate new test cases will be path selection, negation of previous constraints, and boundary condition analysis. 1 Refer to glossary for definitions of terms.…”

Testing: Achievements and Frustrations

“…A method of including 110 specifications is described in [15] and is partially implemented. ation component is restricted to systems of linear predicates but our experimental results show that most predicates can be simplified or transformed to linear expressions.…”