Abstract
This paper describes a method for extracting functional requirements from tests, where tests take the form of vectors of inputs (supplied to the system) and outputs (produced by the system in response to inputs). The approach uses data-mining techniques to infer invariants from the test data, and an automated-verification technology to determine which of these proposed invariants are indeed invariant and may thus be seen as requirements. Experimental results from a pilot study involving an automotive-electronics application show that using tests that fully cover the structure of the software yield more complete invariants than structurally-agnostic black-box tests.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackermann, C., Ray, A., Cleaveland, R., Heit, J., Shelton, C., Martin, C.: Model-based design verification: A monitor based approach. In: SAE WC (2008)
Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD 1993, pp. 207–216. ACM, New York (1993)
Ammons, G., BodÃk, R., Larus, J.R.: Mining specifications. SIGPLAN Not. 37(1), 4–16 (2002)
Ball, T., Rajamani, S.K.: Automatically validating temporal safety properties of interfaces. In: Dwyer, M.B. (ed.) SPIN 2001. LNCS, vol. 2057, pp. 103–122. Springer, Heidelberg (2001)
Biermann, A.W., Feldman, J.: On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Computers, 592–597 (1972)
Charette, R.N.: This car runs on code (February 2009), http://www.spectrum.ieee.org/green-tech/advanced-cars/this-car-runs-on-code
Cheng, X., Hsiao, M.S.: Simulation-directed invariant mining for software verification. In: DATE 2008, pp. 682–687. ACM, New York (2008)
Ernst, M.D., et al.: The Daikon system for dynamic detection of likely invariants. Science of Computer Programming 69(1-3), 35–45 (2007)
Gabel, M., Su, Z.: Symbolic mining of temporal specifications. In: ICSE 2008, pp. 51–60. ACM, New York (2008)
Goues, C., Weimer, W.: Specification mining with few false positives. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 292–306. Springer, Heidelberg (2009)
Hamers, L., et al.: Similarity measures in scientometric research: the jaccard index versus salton’s cosine formula. Inf. Process. Manage. 25(3), 315–318 (1989)
Hangal, S., et al.: Iodine: a tool to automatically infer dynamic invariants for hardware designs. In: DAC 2005, pp. 775–778. ACM, New York (2005)
Mesbah, A., van Deursen, A.: Invariant-based automatic testing of ajax user interfaces. In: ICSE 2009, Washington, pp. 210–220. IEEE, Los Alamitos (2009)
Michael, C.C., Ghosh, A.: Using finite automata to mine execution data for intrusion detection. In: Debar, H., Mé, L., Wu, S.F. (eds.) RAID 2000. LNCS, vol. 1907, pp. 66–79. Springer, Heidelberg (2000)
Raman, A., Patrick, J., North, P.: The sk-strings method for inferring pfsa. In: ICML 1997 (1997)
Ramanathan, M.K., Grama, A., Jagannathan, S.: Static specification inference using predicate mining. SIGPLAN Not. 42(6), 123–134 (2007)
Raz, O.: Helping everyday users find anomalies in data feeds. PhD thesis, Pittsburgh, PA, USA, Chair-Shaw, Mary (2004)
Raz, O., Koopman, P., Shaw, M.: Semantic anomaly detection in online data sources. In: ICSE 2002, pp. 302–312. ACM, New York (2002)
Romesburg, H.C.: Cluster Analysis for Researchers. Lulu Press, North Carolina (2004)
Shoham, S., et al.: Static specification mining using automata-based abstractions. In: ISSTA 2007, pp. 174–184. ACM, New York (2007)
Webb, G.I.: Efficient search for association rules. In: KDD 2000, pp. 99–107. ACM, New York (2000)
Webb, G.I.: Discovering significant patterns. Mach. Learn. 68(1), 1–33 (2007)
Weimer, W., Necula, G.C.: Mining temporal specifications for error detection. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 461–476. Springer, Heidelberg (2005)
Witten, I.H., Frank, E.: Data Mining: Practical machine learning tools and techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ackermann, C., Cleaveland, R., Huang, S., Ray, A., Shelton, C., Latronico, E. (2010). Automatic Requirement Extraction from Test Cases. In: Barringer, H., et al. Runtime Verification. RV 2010. Lecture Notes in Computer Science, vol 6418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16612-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-16612-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16611-2
Online ISBN: 978-3-642-16612-9
eBook Packages: Computer ScienceComputer Science (R0)