Method of Detecting Unary Polynomial Inequality Likely Invariant

Article Preview

Abstract:

Many Studies has carried on the technology of detecting invariants, for example, Daikon can detect most of invariant by presetting some types of them. But unary polynomial inequality likely invariants are rarely discovered by traditional tools. An effective method to detect unary polynomial inequality likely invariant was proposed in this paper. Through analyzing the property of value ranges of unary polynomial inequality likely invariants, the algorithm set the threshold value and calculates neighbor distances to determine the form of invariants. Finally, experimental results are given to demonstrate the effectiveness of this method.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1894-1899

Citation:

Online since:

August 2013

Export:

Price:

[1] Kataoka Y, Notkin D, Ernst M D, et al: Automated support for program refactoring using invariants. Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01). IEEE Computer Society, (2001), p.736.

DOI: 10.1109/icsm.2001.972794

Google Scholar

[2] Sahoo S K, Criswell J, Geigle C, et al: Using likely invariants for automated software fault localization. Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systems. ACM, ( 2013) pp.139-152.

DOI: 10.1145/2451116.2451131

Google Scholar

[3] Harder M, Mellen J, Ernst M D: Improving test suites via operational abstraction. Proceedings of the 25th International Conference on Software Engineering, Portland, (2003), pp.60-71.

DOI: 10.1109/icse.2003.1201188

Google Scholar

[4] Pytlik B, Renieris M, Krishnamurthi S, Reiss S: Automated fault localization using potential invariants. In Proc. Fifth Int', Workshop Automated and Algorithmic Debugging (AADEBUG ', 03), (2003), pp.273-276.

Google Scholar

[5] Ernst, M. D: Dynamically discovering likely program invariants (Doctoral dissertation, University of Washington, 2000).

Google Scholar

[6] Michael D. Ernst, Jeff H. Perkins, Philip J. Guo et al: The Daikon system for dynamic detection of likely invariants. Science of Computer Programming. Vol. 69 (2007), pp.35-45.

DOI: 10.1016/j.scico.2007.01.015

Google Scholar

[7] Xie, T., Notkin, D: Exploiting Synergy between testing and inferred partial specification. In Workshop on Dynamic Analysis, (2003), p.17–20.

Google Scholar

[8] Xiao-hua Y, Jie L, Tong-lan Y, et al: Dynamically Discovering Functional Likely Program Invariants Based on Relational Database Theory. Proceedings of Computational Intelligence and Software Engineering. (2009).

DOI: 10.1109/cise.2009.5364452

Google Scholar

[9] Qujin Wu: Dynamically Discovering Program Invariants Base on Evolution. Information Technology, (2008), pp.10-13.

Google Scholar

[10] Guoqing Hu: Analyses and Detection of Logical Expression Likely Invariants. (Master dissertation, University of South China, 2007).

Google Scholar