Abstract
All software engineering process, which includes designing, implementing and modifying of software, are done to develop a software as fast as possible and also to reach a high quality, efficient and maintainable software. Invariants, as rather always true properties of program context, can help developers to do some aspect of software engineering more easily; therefore any improvement in extracting of more relevant invariant can help software engineering process. Conditional invariant is a novel kind of invariant which is turned in when some conditions are provided in program execution. Conditional invariant can exhibit program behavior much better. In order to extract this kind of invariants, it might be used some technique of data mining such as association rule mining or using decision tree to obtain rules. This paper spans feasibility of conditional invariant and advantageous of this kind of invariant compared to ordinary invariant.
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
Krkay, I., Brunx, Y., Popescuy, D., Garciay, J., Medvidovic, N.: Using dynamic execution traces and program invariants to enhance behavioral model inference. In: ICSE NIER (2010)
Vanmali, M., Last, M., Kandel, A.: Using a neural network in the software testing process. International Journal of Intelligent Systems 17(1), 45–62 (2002)
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)
Ernst, M.D., et al.: Dynamically discovering likely program invariants to support program evolution. In: Proc. ICSE 1999, pp. 213–224. ACM (1999)
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)
Ernst, M.D., Perkins, J.H., Guo, P.J., McCamant, S., Pacheco, C., Tschantz, M.S., Xiao, C.: The Daikon System for Dynamic Detection of Likely Invariants. Science of Computer Programming (2006)
Csallner, C., et al.: DySy: Dynamic symbolic execution for invariant inference. In: Proc. of ICSE (2008)
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)
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, M.H., Parvin, H., Minaei, B. (2011). Theoretical Feasibility of Conditional Invariant Detection. 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_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-27337-7_16
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)