Axes that are out of bounds are usually permitted by baggy bounds. This only occurs when the axes stick within specific bounds. With regard to this, a program may fail. This may happen in such a case as having a baggy bounds system cause an error that is of a hard synchronous nature. This occurs when one goes past a baggy bound’s half a slot on its edge. A bound may be out of bounds when there a few bytes past a baggy bound, in which case there will occur no error. In the case of making a trial of dereferencing a program on a subsequent basis, a pointer may have a high order bid set upon it which may then lead to the occurrence of a hard fault. When bytes in a program hold a power of 2, there will exist no bagginess in bounds. In the event that static code analysis can be utilized in figuring out the safety of a set of operations of a pointer, then not every pointer operation ought to be instrumented (In Jajodia, 2014).