article · ACM SIGSOFT Software Engineering Notes · 2014

Optimization of program invariants

Cited by 0Abstract and details only

Abstract

Program invariants can be detected using both static and dynamic approaches. Dynamic methods that complement static methods will be more useful and effective in analyzing software artifacts. Existing dynamic invariant detection techniques detect both relevant and irrelevant invariants due to the presence of relevant and irrelevant/unused variables in the program. Therefore, the speed and efficiency of the techniques are affected. Also, displaying properties about irrelevant variables distracts the user from concentrating on properties of relevant variables. Moreover, these irrelevant invariants do not contribute to the correctness of the program. Therefore, there is a need to overcome the above deficiencies. This is done in three phases in this paper. In the first phase, only the relevant variables are considered by ignoring irrelevant variables. In the second phase, relevant variables are classified into two different types as design variables and non-design variables by using proposed metrics. These metrics are validated analytically against Weyuker's principles. Similarly, relevant invariants are categorized into three types as design invariants, non-design invariants and hybrid invariants in the third phase. For this purpose a set of rules are proposed. This process enormously improves the speed and efficiency of dynamic invariant detection techniques. Also, it drastically reduces the effort that is required to validate program correctness.

Cite this paper

APA 7

Rao, A. A., & Raju, P. R. (2014). Optimization of program invariants. ACM SIGSOFT Software Engineering Notes, 39(1), 1–9. https://doi.org/10.1145/2557833.2557852

MLA 9

Rao, A. Ananda, and P. Radhika Raju. “Optimization of program invariants.” ACM SIGSOFT Software Engineering Notes, vol. 39, no. 1, 2014, pp. 1–9, https://doi.org/10.1145/2557833.2557852.

Chicago

Rao, A. Ananda, and P. Radhika Raju. 2014. “Optimization of program invariants.” ACM SIGSOFT Software Engineering Notes 39 (1): 1–9. https://doi.org/10.1145/2557833.2557852.

Harvard

Rao, A.A. and Raju, P.R. (2014) ‘Optimization of program invariants’, ACM SIGSOFT Software Engineering Notes, 39(1), pp. 1–9. Available at: https://doi.org/10.1145/2557833.2557852.

BibTeX

@article{rao2014optimization,
  title = {{Optimization of program invariants}},
  author = {Rao, A. Ananda and Raju, P. Radhika},
  journal = {ACM SIGSOFT Software Engineering Notes},
  volume = {39},
  number = {1},
  pages = {1--9},
  year = {2014},
  doi = {10.1145/2557833.2557852}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.