Editing Data-flow analysis (section)

==References==
{{reflist|refs=
<ref name="Kildall_1972_Optimization">{{Cite book |title=Global expression optimization during compilation |author-first=Gary Arlen |author-last=Kildall |author-link=Gary Arlen Kildall |type=Ph.D. dissertation |publisher=[[University of Washington]], Computer Science Group |location=Seattle, Washington, USA |date=May 1972<!-- Technical Report: June 1972 --> |id=Thesis No. 20506, Technical Report No. 72-06-02}}</ref>
<ref name="Kildall_1973_Optimization">{{cite journal |author-first=Gary Arlen |author-last=Kildall |author-link=Gary Kildall |date=1973-10-01 |title=A Unified Approach to Global Program Optimization |journal=Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) |series=POPL '73 |location=Boston, Massachusetts, USA |pages=194–206 |doi=10.1145/512927.512945 |hdl=10945/42162 |s2cid=10219496 |url=http://static.aminer.org/pdf/PDF/000/546/451/a_unified_approach_to_global_program_optimization.pdf |access-date=2006-11-20 |url-status=live |archive-url=https://web.archive.org/web/20170629213307/http://static.aminer.org/pdf/PDF/000/546/451/a_unified_approach_to_global_program_optimization.pdf |archive-date=2017-06-29}} ([http://portal.acm.org/citation.cfm?id=512945&coll=portal&dl=ACM])</ref>
<ref name="Cortesi_1999">{{cite book |title=Static Analysis: 6th International Symposium, SAS'99, Venice, Italy, September 22–24, 1999, Proceedings |chapter=Optimization: Detecting Equalities of Variables, Combining Efficiency with Precision |author-first1=Oliver |author-last1=Rüthing |author-first2=Jens |author-last2=Knoop |author-first3=Bernhard |author-last3=Steffen |author-link3=Bernhard Steffen (computer scientist) |series=Lecture Notes in Computer Science |volume=1694 |editor-first1=Agostino |editor-last1=Cortesi |editor-first2=Gilberto |editor-last2=Filé |edition=illustrated |publisher=Springer |date=2003-07-31 |orig-year=1999 |issn=0302-9743 |isbn=9783540664598  |pages=232–247 [233<!-- relevant page -->] |chapter-url=https://books.google.com/books?id=ZwxqCQAAQBAJ&pg=PA233}}</ref>
<ref name="Laws_2014_IEEE">{{cite web |title=Legacy of Gary Kildall: The CP/M IEEE Milestone Dedication |author-first1=Robert |author-last1=Huitt |author-first2=Gordon |author-last2=Eubanks |author-link2=Gordon Eubanks |author-first3=Thomas "Tom" Alan |author-last3=Rolander |author-link3=Thomas Alan Rolander |author-first4=David |author-last4=Laws |author-first5=Howard E. |author-last5=Michel |author-first6=Brian |author-last6=Halla |author-first7=John Harrison |author-last7=Wharton |author-link7=John Harrison Wharton |author-first8=Brian |author-last8=Berg |author-first9=Weilian |author-last9=Su |author-first10=Scott |author-last10=Kildall |author-link10=Scott Kildall |author-first11=Bill |author-last11=Kampe |editor-first=David |editor-last=Laws |date=2014-04-25 |location=Pacific Grove, California, USA |type=video transscription |id=CHM Reference number: X7170.2014 |publisher=[[Computer History Museum]] |url=https://archive.computerhistory.org/resources/access/text/2014/06/102746909-05-01-acc.pdf |access-date=2020-01-19 |quote=[…] [[Gordon Eubanks|Eubanks]]: […] [[Gary Arlen Kildall|Gary]] […] was an inventor, he was inventive, he did things. His Ph.D. thesis proved that global flow analysis converges. […] This is a fundamental idea in computer science. […] I took a […] summer course once from a guy named [[Dhananjay M. Dhamdhere|Dhamdhere]] […] they talked about optimization for like a week and then they put a slide up and said, "Kildall's Method," this is the real story. […] that's something that no one ever thinks about. […]}} [https://ethw.org/Milestones:The_CP/M_Microcomputer_Operating_System,_1974][https://www.youtube.com/watch?v=HO6IPpL0y8g] (33 pages)</ref>
<ref name="Cooper_2004">{{cite web |author-first1=Keith D. |author-last1=Cooper |author-link1=Keith D. Cooper |author-first2=Timothy J. |author-last2=Harvey |author-first3=Ken |author-last3=Kennedy |author-link3=Ken Kennedy (computer scientist) |title=Iterative Data-Flow Analysis, Revisited |work=PLDI 2003 |date=2004-03-26 |orig-year=November 2002 |publisher=[[Association for Computing Machinery|ACM]] |id=TR04-432 |url=https://www.cs.rice.edu/uploadedFiles/Computer_Science/Research/Tech_Reports/2004/TR04-432.pdf |access-date=2017-07-01 }}{{Dead link|date=July 2019 |bot=InternetArchiveBot |fix-attempted=yes}}</ref>
<ref name="Mohnen_2002">{{cite book |author-last=Mohnen |author-first=Markus |title=Compiler Construction |chapter=A Graph—Free Approach to Data—Flow Analysis |date=2002 |volume=2304 |pages=185&ndash;213 |doi=10.1007/3-540-45937-5_6 |series=Lecture Notes in Computer Science |isbn=978-3-540-43369-9 }}</ref>
<ref name="Kuang_2015">{{cite journal |author-last1=Kuang |author-first1=Hongyu |author-last2=Mäder |author-first2=Patrick |author-last3=Hu |author-first3=Hao |author-last4=Ghabi |author-first4=Achraf |author-last5=Huang |author-first5=LiGuo |author-last6=Lü |author-first6=Jian |author-last7=Egyed |author-first7=Alexander |date=2015-11-01 |title=Can method data dependencies support the assessment of traceability between requirements and source code? |journal=Journal of Software: Evolution and Process |volume=27 |issue=11 |pages=838–866 |doi=10.1002/smr.1736 |s2cid=39846438 |issn=2047-7481}}</ref>
<ref name="Naeem_2010">{{Citation |author-last1=Naeem |author-first1=Nomair A. |chapter=Practical Extensions to the IFDS Algorithm |date=2010 |pages=124–144 |publisher=[[Springer Verlag]] |location=Berlin / Heidelberg, Germany |isbn=978-3-64211969-9 |author-last2=Lhoták |author-first2=Ondřej |author-last3=Rodriguez |author-first3=Jonathan |title=Compiler Construction |series=Lecture Notes in Computer Science |volume=6011 |doi=10.1007/978-3-642-11970-5_8|doi-access=free }}</ref>
<ref name="Bodden_2012">{{Cite book |author-last=Bodden |author-first=Eric |title=Proceedings of the ACM SIGPLAN International Workshop on State of the Art in Java Program analysis |chapter=Inter-procedural data-flow analysis with IFDS/IDE and Soot |date=2012 |pages=3–8 |location=New York, New York, USA |publisher=[[ACM Press]] |doi=10.1145/2259051.2259052 |isbn=978-1-45031490-9|s2cid=3020481 }}</ref>
<ref name="Rapoport_2015">{{cite conference |author-last1=Rapoport |author-first1=Marianna | title=Precise Data Flow Analysis in the Presence of Correlated Method Calls |year=2015 | conference = International Static Analysis Symposium |pages=54–71 |publisher=[[Springer Verlag]] |location=Berlin / Heidelberg, Germany |isbn=978-3-66248287-2 |author-last2=Lhoták |author-first2=Ondřej |author-last3=Tip |author-first3=Frank |series=Lecture Notes in Computer Science |volume=9291 |doi=10.1007/978-3-662-48288-9_4}}</ref>
<ref name="Knoop_1996">{{cite journal |author-last1=Knoop |author-first1=Jens |author-last2=Steffen |author-first2=Bernhard |author-link2=Bernhard Steffen (computer scientist) |author-last3=Vollmer |author-first3=Jürgen |date=1996-05-01 |title=Parallelism for free: efficient and optimal bitvector analyses for parallel programs |journal=ACM Transactions on Programming Languages and Systems |volume=18 |issue=3 |pages=268–299 |doi=10.1145/229542.229545 |s2cid=14123780 |issn=0164-0925 |url=https://publikationen.bibliothek.kit.edu/369596|doi-access=free }}</ref>
<ref name="Reps_1995">{{cite book |author-last1=Reps |author-first1=Thomas |author-last2=Horwitz |author-first2=Susan |author-last3=Sagiv |author-first3=Mooly |title=Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 |chapter=Precise interprocedural dataflow analysis via graph reachability |date=1995 |pages=1, 49–61 |location=New York, New York, USA |publisher=[[ACM Press]] |doi=10.1145/199448.199462 |isbn=0-89791692-1|s2cid=5955667 }}</ref>
}}