Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Floyd, R.W.: Assigning meanings to programs. In: Symposium on Applied Mathematics, pp. 19–32. American Mathematical Society (1967)
Ernst, M.D., Cockrell, J., Griswold, W.G., Notkin, D.: Dynamically discovering likely program invariants to support program evolution. IEEE TSE 27(2), 99–123 (2007)
Weiß, B.: Inferring invariants by static analysis in KeY. Diplomarbeit, University of Karlsruhe (March 2007)
Jones, N.D., Nielson, F.: Abstract interpretation: A semanticsbased tool for program analysis. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 4, pp. 527–636. Oxford University Press (1995)
Boshernitsan, M., Doong, R., Savoia, A.: From Daikon to Agitator: Lessons and challenges in building a commercial tool for developer testing. In: ISSTA, pp. 169–179 (2006)
Hangal, S., Lam, M.S.: Tracking down software bugs using automatic anomaly detection. In: ICSE, pp. 291–301 (2002)
Csallner, C., et al.: DySy: Dynamic symbolic execution for invariant inference. In: Proc. of ICSE (2008)
Ernst, M.D., Czeisler, A., Griswold, W.G., Notkin, D.: Quickly detecting relevant program invariants. In: ICSE, Limerick, Ireland, June 7-9 (2000)
Ernst, M.D., Griswold, W.G., Kataoka, Y., Notkin, D.: Dynamically Discovering Program Invariants Involving Collections, Technical Report, University of Washington (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fouladgar, H., Parvin, H., Alizadeh, H., Minaei, B. (2011). Dynamics Invariant Extension of Arrays in Daikon Like Tools. In: Pichappan, P., Ahmadi, H., Ariwa, E. (eds) Innovative Computing Technology. INCT 2011. Communications in Computer and Information Science, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27337-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-27337-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27336-0
Online ISBN: 978-3-642-27337-7
eBook Packages: Computer ScienceComputer Science (R0)