Extension in The Case of Arrays in Daikon like Tools

Authors

M. H. Fouladgar School of Computer Engineering, Iran University of Science and Technology (IUST), Tehran, Iran
B. Minaei-Bidgoli School of Computer Engineering, Iran University of Science and Technology (IUST), Tehran, Iran
H. Parvinb Department of Computer Engineering, Nourabad Branch, Islamic Azad University, Nourabad, Iran
H. Alinejad-Rokny Complex Systems in Biology Group, Centre for Vascular Research, Faculty of Medicine, The University of New South Wales, Sydney, NSW, Australia- School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW, Australia

Dynamic invariant detection, software testing, array property, array’s first & last elements, mutual element, between arrays.

Software engineering comprises some processes such as designing, implementing and modifying of code. These

processes are done to generate software fast and have a high quality, efficient and maintainable software. In order to

perform these processes, invariants can useful and help programmers and testers. Arrays and pointers are frequent data

types and are used in program code repeatedly. Because of this conventional use, these two data types can be the reason of

fault in some program codes. First and last elements of arrays can confront to fault because of carelessness in using index

in loops. Also arrays with the same type mostly have some relations which can be probably faulty. Therefore invariants

which can report array and pointer properties are functional. This paper presented some constructive extension to Daikon

like tools so that can produce more relevant invariants in the case of array.

Download data is not yet available.