Information-flow and data-flow analysis of while-programs
- 2 January 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 7 (1) , 37-61
- https://doi.org/10.1145/2363.2366
Abstract
Until recently, information-flow analysis has been used primarily to verify that information transmission between program variables cannot violate security requirements. Here, the notion of information flow is explored as an aid to program development and validation. Information-flow relations are presented for while-programs, which identify those program statements whose execution may cause information to be transmitted from or to particular input, internal, or output values. It is shown with examples how these flow relations can be helpful in writing, testing, and updating programs; they also usefully extend the class of errors which can be detected automatically in the “static analysis” of a program.Keywords
This publication has 12 references indexed in Scilit:
- Programmers use slices when debuggingCommunications of the ACM, 1982
- An Axiomatic Approach to Information Flow in ProgramsACM Transactions on Programming Languages and Systems, 1980
- Algorithms for adaptive linear predictionThe Computer Journal, 1980
- High-level data flow analysisCommunications of the ACM, 1977
- Certification of programs for secure information flowCommunications of the ACM, 1977
- Data Flow Analysis in Software ReliabilityACM Computing Surveys, 1976
- A program data flow analysis procedureCommunications of the ACM, 1976
- A Fast and Usually Linear Algorithm for Global Flow AnalysisJournal of the ACM, 1976
- Efficient determination of the transitive closure of a directed graphInformation Processing Letters, 1971
- A Theorem on Boolean MatricesJournal of the ACM, 1962