A Systematic Judgment to Automated Programming Contracts Generation
S. V. Gayetri Devi1, C. Nalini2
1S.V. Gayetri Devi, Research Scholar Department of Computer Science and Engineering Bharath Institute of Higher Education and Research Chennai, India.
2C. Nalini, Professor Department of Computer Science and Engineering Bharath Institute of Higher Education and Research Chennai, India.
Manuscript received on 12 March 2019 | Revised Manuscript received on 17 March 2019 | Manuscript published on 30 July 2019 | PP: 5017-5025 | Volume-8 Issue-2, July 2019 | Retrieval Number: B1081078219/19©BEIESP | DOI: 10.35940/ijrte.B1081.078219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Contracts provide a pre-emptive approach in identifying programming errors at run-time using assertions or by formal Static analysis tool or Manual source code reviews. They describe the expected software behavior. Contracts written by developers have a greater error detection ability than the generic ones that are created automatically but may involve strenuous efforts for larger sized source codes. The intent of this paper is a concise study of prevalent approaches in the generation of contracts and to put forward an approach to derive programming rules for real-time concurrent Java source code automatically with reduced efforts. The proposed method extracts the scalar variables and computed constants from Static program code analysis, then identifies various dependencies dynamically and generates the declarative contracts automatically by Decision tree modeling of computed dependencies. These rules can then be utilized for software Verification.
Index Terms: Contracts, Software Analysis, Dependencies, Decision trees, Optimization
Scope of the Article: Discrete Optimization