Data flow analysis of recursive procedures

Authors:
P. Fairfield;M. A. Hennell
Affiliations:
University of Liverpool, Liverpool, UK;University of Liverpool, Liverpool, UK
Venue:
ACM SIGPLAN Notices
Year:
1988

Citing 2
Cited 3

Validation, Verification, and Testing of Computer Software

ACM Computing Surveys (CSUR)
An algebra for data flow anomaly detection

ICSE '84 Proceedings of the 7th international conference on Software engineering

Cesar: a static sequencing constraint analyzer

TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Interprocedural static analysis of sequencing constraints

ACM Transactions on Software Engineering and Methodology (TOSEM)
Testing techniques in software engineering

Testing techniques in software engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

Data flow analysis is a technique used to detect suspicious variable usage within a program. Its evaluation requires analysis of the flow graphs of the program. This causes difficulties when the program contains recursive procedures because in order to fully evaluate each procedure, the data flow value of its own recursive invocation needs to be known first. This however cannot be determined until the whole procedure has been analysed. This paper describes a technique for resolving this difficulty and successfully completing data flow analysis on recursive procedures.