Abstract

Software engineering included some different process such as designing, implementing and modifying of software. All these processes are done to have fast developed software as well as reach a high quality, efficient and maintainable software. Invariants help programmer and tester to do most steps of software engineering more easily. Invariants are mostly always true but of course with a specific confidence. Since some invariants are produced in some conditions of program execution and not always, conditional invariants can show the behavior of program so much better. For producing this kind of invariants, it might use some technique of data mining such as association rule mining or using decision tree to obtain rules. So the paper will introduce a new perspective to dynamic invariant detection. Also the feasibility of conditional invariant detection is examined and a framework to extract them is proposed.

Key words: Daikon, invariant, association rules, variable relations, decision tree, program point, data mining, software engineering, predicate, verification.