Editing Code refactoring (section)

===Static analysis===
[[Static program analysis]] (called "linting" when performed on less strict interpreted languages) detects problems in a valid but substandard program.

* [[Program dependence graph]] - explicit representation of data and control dependencies <ref>
{{Cite journal
|last1=Ferrante|first1=Jeanne
|last2=Ottenstein|first2=Karl J.
|last3=Warren|first3=Joe D.
|date=July 1987
|title= The program dependence graph and its use in optimization
|journal=ACM Transactions on Programming Languages and Systems 
|volume=9
|issue=3
|pages=319–349
|publisher=ACM
|doi=10.1145/24039.24041
|s2cid=505075
|doi-access=free
}}</ref>
* System dependence graph - representation of procedure calls between PDG <ref>
{{Cite conference
|last1=Donglin|first1=Linag
|last2=Harrold|first2=M. J.
|book-title=Proceedings, International Conference on Software Maintenance (Cat. No. 98CB36272)
|title=Slicing objects using system dependence graphs
|date=November 2008
|pages=319–349
|publisher=IEEE
|doi=10.1109/ICSM.1998.738527
|isbn=978-0-8186-8779-2
|s2cid=18160599
}}</ref>
* [[Cyclometric complexity]] analysis.
* [[Software intelligence]] - reverse engineers the initial state to understand existing intra-application dependencies