Enriching dynamically detected invariants in the case of arrays

  • Authors:

  • Mohammadhani Fouladgar;Behrouz Minaei-Bidgoli;Hamid Parvin

  • Affiliations:

  • School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran;School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran;School of Computer Engineering, Iran University of Science and Technology, Tehran, Iran

  • Venue:
  • ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Software engineering is the work of designing, implementing and modifying of software to build software fast and have a high quality, efficient and maintainable software. Invariant helps programmer and tester to perform some aspect of software engineering. Since arrays and pointers are more probable to be faulty, invariants which report these properties are more useful. By presenting first and last elements of arrays we can detect the carelessness in using index which mostly happens in loops. The idea of employing number of mutual elements between two same type arrays can help us to catch faults in the cases that an array is gained from changes in another array. These two properties help us to capture lots of prevalent faults and therefore try to remove them. This paper proposes an interesting sort of extension over Daikon like tools. It can generate more invariant in the case of array.