Invariants and state in testing and formal methods

Authors:
Dick Hamlet
Affiliations:
Portland State University, Portland, OR
Venue:
PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Year:
2005

Citing 7
Cited 1

A Practical Approach to Programming With Assertions

IEEE Transactions on Software Engineering
Test data as an aid in proving program correctness

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Dynamically Discovering Likely Program Invariants to Support Program Evolution

IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
Toward a theory of test data selection

Proceedings of the international conference on Reliable software
TestEra: A Novel Framework for Automated Testing of Java Programs

Proceedings of the 16th IEEE international conference on Automated software engineering
Tool-assisted unit-test generation and selection based on operational abstractions

Automated Software Engineering

Adaptive correctness monitoring for wireless sensor networks using hierarchical distributed run-time invariant checking

ACM Transactions on Autonomous and Adaptive Systems (TAAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logical formulas called invariants are a staple of formal methods for program analysis. Persistent-state variables appear in these formulas playing their proper intuitive role, which is somewhere between inputs and internal variables. In software testing theory, on the contrary, state is not usually accorded explicit treatment. Comparing the viewpoints of formal methods and testing theory suggests new roles that formal methods can play in testing. This examination is motivated by recent systems such as Daikon, which use both tests and invariants.