Description of input and output data of programs fragments

MaRDI QIDQ1284341zbMATH OpenFDO

Authors Vl. Val. Voevodin

Publication date 14 April 1999

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

algorithm graphstatic analysis

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Review text

Many problems arising during developing and debugging of programs demand an exact description of data-in and data-out sets. The author considers the application of the technique of the construction of an algorithm graph for solving the problem of finding data-in and data-out sets of the fragment of the programme and shows the possible fields of its application. An important aspect is that only methods of static analysis for solving the problem are used. These methods are based on the investigation of the original text of the programme without using any information from the stage of its implementation.

Recommendations

• scientific article; zbMATH DE number 2243645
• Information-flow and data-flow analysis of while-programs
• Modern methods for interprocedural program analysis
• scientific article; zbMATH DE number 1407672

Cited in

(1)

• scientific article; zbMATH DE number 2243645 (Why is no real title available?)

This page was built for publication: Description of input and output data of programs fragments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284341)