New efficient techniques for dynamic detection of likely invariants

Authors:
Saeed Parsa;Behrouz Minaei;Mojtaba Daryabari;Hamid Parvin
Affiliations:
Computer Engineering School, Iran University of Science and Technology, Tehran, Iran;Computer Engineering School, Iran University of Science and Technology, Tehran, Iran;Computer Engineering School, Iran University of Science and Technology, Tehran, Iran;Computer Engineering School, Iran University of Science and Technology, Tehran, Iran
Venue:
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
Year:
2011

Citing 11
Cited 0

Data flow analysis for verifying properties of concurrent programs

SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
LCLint: a tool for using specifications to check code

SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Query-based debugging of object-oriented programs

Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Discovering models of software processes from event-based data

ACM Transactions on Software Engineering and Methodology (TOSEM)
Event-based detection of concurrency

SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
An Introduction to Genetic Algorithms

An Introduction to Genetic Algorithms
Automatic generation of program specifications

ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Automated Support for Program Refactoring using Invariants

ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Efficient incremental algorithms for dynamic detection of likely invariants

Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Generalized cycle crossover for graph partitioning

Proceedings of the 8th annual conference on Genetic and evolutionary computation
The Daikon system for dynamic detection of likely invariants

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Invariants could be defined as prominent relation among program variables. Daikon software has implemented a practical algorithm for invariant detection. There are several other dynamic approaches to dynamic invariant detection. Daikon is considered to be the best software developed for dynamic invariant detection in comparing other dynamic invariant detection methods. However this method has some problems. Its time order is highly which this results in uselessness in practice. The bottleneck of the algorithm is predicate checking. In this paper, two new techniques are presented to improve the performance of the Daikon algorithm. Experimental results show that With regard to these amendments, runtime of dynamic invariant detection is much better than the original method.