Revision as of 23:25, 31 July 2020 edit Mark viking (talk \| contribs) Extended confirmed users 19,326 edits Now has a source, deleting tag ← Previous edit		Revision as of 09:25, 1 August 2020 edit undo Phil Bridger (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 49,648 edits contest deletion - has previously been deprodded, and, anyway, notability is shown by the results of Google Scholar and Books searches for the title Next edit →
Line 1: ~~{{Proposed deletion/dated~~ ~~\|concern = This is buzzword, blanket article with no real content and which has had no sources since 2005.~~ ~~\|timestamp = 20200731203827~~ ~~\|nom = Dgpop~~ ~~\|help =~~ }} ~~{{multiple issues\|~~ ~~{{notability\|date=May 2018}}~~ {{Expert-subject\|Computer science\|date=February 2009}} }} In [[computer science]], '''array access analysis''' is a [[compiler analysis]] approach used to decide the read and write access patterns to elements or portions of arrays.<ref name="Paek2002">{{cite journal \|last1=Paek \|first1=Yunheung \|last2=Hoeflinger \|first2=Jay \|last3=Padua \|first3=David \|title=Efficient and precise array access analysis \|journal=ACM Transactions on Programming Languages and Systems (TOPLAS) \|date=January 2002 \|volume=24 \|issue=1 \|pages=65–109 \|doi=10.1145/509705.509708}}</ref>

Array-access analysis: Difference between revisions