Issue No. 07 - July (2001 vol. 27)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.935856
<p><b>Abstract</b>—Writing requirements in a formal notation permits automatic assessment of such properties as ambiguity, consistency, and completeness. However, verifying that the properties expressed in requirements are preserved in other software life cycle artifacts remains difficult. The existing techniques either require substantial manual effort and skill or suffer from exponential explosion of the number of states in the generated state spaces. “Light-weight” formal methods is an approach to achieve scalability in <it>fully automatic</it> verification by checking an <it>abstraction</it> of the system for only <it>certain</it> properties. This paper describes light-weight techniques for automatic analysis of consistency between software requirements (expressed in SCR) and detailed designs in low-degree-polynomial time, achieved at the expense of using imprecise data-flow analysis techniques. A specification language SCR describes the systems as state machines with event-driven transitions. We define detailed designs to be consistent with their SCR requirements if they contain exactly the same transitions. We have developed a language for specifying detailed designs, an analysis technique to create a model of a design through data-flow analysis of the language constructs, and a method to automatically generate and check properties derived from requirements to ensure a design's consistency with them. These ideas are implemented in a tool named <scp>cord</scp>, which we used to uncover errors in designs of some existing systems.</p>
SCR requirements, static analysis, formal specification, finite-state abstraction, data-flow analysis.
M. Chechik and J. Gannon, "Automatic Analysis of Consistency between Requirements and Designs," in IEEE Transactions on Software Engineering, vol. 27, no. , pp. 651-672, 2001.