Edited wiki page ArrayBoundCheckElimination through web user interface.
diff --git a/ArrayBoundCheckElimination.wiki b/ArrayBoundCheckElimination.wiki index 0970045..a8d4ef4 100644 --- a/ArrayBoundCheckElimination.wiki +++ b/ArrayBoundCheckElimination.wiki
@@ -7,7 +7,7 @@ <b>1.Contact Details:</b> <b>Name:</b> Sad Al Abdullah<br /> - <b>Email Address:</b> siam9090@gmail.com,siam9090@yahoo.com <br /> + <b>Email Address:</b><font color="blue"> siam9090@gmail.com,siam9090@yahoo.com </font><br /> <b>Cell Phone:</b> +880 1915999955<br /> ---------------------------- <b>2.My Proposed Project:</b> @@ -43,7 +43,7 @@ <b>Minimal Control Flow Graph (MCFG):</b> - <p> Eliminating empty node and optimize the CFG , minimal control flow graph(MCFG) is construct. The MCFG is unique by Claim. The nodes contained in the MCFG are the non-empty set of nodes which is unique. It will help to implement of range checking efficiently.</p> + <p> Eliminating empty node and optimize the CFG , minimal control flow graph(MCFG) is construct. The MCFG is unique by <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.85.5471&rep=rep1&type=pdf">Claim</a>. The nodes contained in the MCFG are the non-empty set of nodes which is unique. It will help to implement of range checking efficiently.</p> <p>Array Bound Check Elimination : # Local Elimination # Global Elimination