Entropy and software systems: towards an information-theoretic foundation of software testing

Authors:
Linmin Yang;Zhe Dang;Thomas R. Fischer;Min Sik Kim;Li Tan
Affiliations:
Washington State University, Pullman, WA, USA;Washington State University, Pullman, WA, USA;Washington State University, Pullman, WA, USA;Washington State University, Pullman, WA, USA;Washington State University, Pullman, WA, USA
Venue:
Proceedings of the FSE/SDP workshop on Future of software engineering research
Year:
2010

Citing 5
Cited 0

Statecharts: A visual formalism for complex systems

Science of Computer Programming
Model checking

Model checking
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
A Complexity Measure

IEEE Transactions on Software Engineering
Introduction to Software Testing

Introduction to Software Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We integrate information theory into software testing. In particular, we use entropy in information theory to measure the amount of uncertainty in a software system before it is fully tested, and we show how the amount decreases when we test the system. Moreover, we introduce behaviorial complexity as a novel complexity metric for labeled graphs (which can be interpreted as control flow graphs, design specifications, etc.), which is also based on information theory. We seek practical approaches in testing real systems using the above theories, and we apply our novel approaches in testing model-based embedded systems and network intrusion detection systems. Our information-theoretic approach is syntax-independent, which is a desired property in software testing.