{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:31:27Z","timestamp":1747809087007,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642170706"},{"type":"electronic","value":"9783642170713"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17071-3_14","type":"book-chapter","created":{"date-parts":[[2010,11,11]],"date-time":"2010-11-11T12:12:58Z","timestamp":1289477578000},"page":"272-289","source":"Crossref","is-referenced-by-count":2,"title":["Incrementally Discovering Testable Specifications from Program Executions"],"prefix":"10.1007","author":[{"given":"Neil","family":"Walkinshaw","sequence":"first","affiliation":[]},{"given":"John","family":"Derrick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Derrick, J., Walkinshaw, N.: Property-based testing: The protest project. In: FMCO (2009)","DOI":"10.1007\/978-3-642-17071-3_13"},{"key":"14_CR2","unstructured":"Armstrong, J.: Programming Erlang: Software for a Concurrent World. Pragmatic Bookshelf (July 2007)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-05089-3_20","volume-title":"FM 2009: Formal Methods","author":"N. Walkinshaw","year":"2009","unstructured":"Walkinshaw, N., Derrick, J., Guo, Q.: Iterative refinement of reverse-engineered models by model-based testing. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 305\u2013320. Springer, Heidelberg (2009)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Walkinshaw, N., Bogdanov, K., Holcombe, M., Salahuddin, S.: Improving Dynamic Software Analysis by Applying Grammar Inference Principles. Journal of Software Maintenance and Evolution: Research and Practice (2008)","DOI":"10.1002\/smr.373"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Claessen, K., Hughes, J.: Quickcheck: A Lightweight Tool for Random Testing of Haskell Programs. In: Proceedings of the International Conference on Functional Programming (ICFP), pp. 268\u2013279 (2000)","DOI":"10.1145\/351240.351266"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Walkinshaw, N., Bogdanov, K., Ali, S., Holcombe, M.: Automated discovery of state transitions and their functions in source code. Software Testing, Verification and Reliability\u00a018(2) (2008)","DOI":"10.1002\/stvr.380"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1515\/9781400882618-006","volume-title":"Annals of Mathematics Studies (34), Automata Studies","author":"E.F. Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken\u2013experiments on sequential machines. In: Shannon, C.E., McCarthy, J. (eds.) Annals of Mathematics Studies (34), Automata Studies, pp. 129\u2013153. Princeton University Press, Princeton (1956)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automata transformations. Proceedings of the American Mathematical Society\u00a09, 541\u2013544 (1958)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E.: Language Identification in the Limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"21","author":"A. Biermann","year":"1972","unstructured":"Biermann, A., Feldman, J.: On the Synthesis of Finite-State Machines from Samples of their Behavior. IEEE Transactions on Computers\u00a021, 592\u2013597 (1972)","journal-title":"IEEE Transactions on Computers"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/08839510701853200","volume":"22","author":"P. Dupont","year":"2008","unstructured":"Dupont, P., Lambeau, B., Damas, C., van Lamsweerde, A.: The QSM Algorithm and its Application to Software Behavior Model Induction. Applied Artificial Intelligence\u00a022, 77\u2013115 (2008)","journal-title":"Applied Artificial Intelligence"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Walkinshaw, N., Bogdanov, K., Holcombe, M., Salahuddin, S.: Reverse Engineering State Machines by Interactive Grammar Inference. In: 14th IEEE International Working Conference on Reverse Engineering, WCRE (2007)","DOI":"10.1109\/WCRE.2007.45"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/287000.287001","volume":"7","author":"J. Cook","year":"1998","unstructured":"Cook, J., Wolf, A.: Discovering Models of Software Processes from Event-Based Data. ACM Transactions on Software Engineering and Methodology\u00a07(3), 215\u2013249 (1998)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Ammons, G., Bod\u00edk, R., Larus, J.: Mining Specifications. In: 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Portland, Oregon, pp. 4\u201316 (2002)","DOI":"10.1145\/503272.503275"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Information and Computation\u00a075, 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"M. Shahbaz","year":"2009","unstructured":"Shahbaz, M., Groz, R.: Inferring mealy machines. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 207\u2013222. Springer, Heidelberg (2009)"},{"key":"14_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"K. Lang","year":"1998","unstructured":"Lang, K., Pearlmutter, B., Price, R.: Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TSE.1976.233812","volume":"2","author":"A.W. Biermann","year":"1976","unstructured":"Biermann, A.W., Krishnaswamy, R.: Constructing programs from example computations. IEEE Trans. on Software Engineering SE\u00a02, 141\u2013153 (1976)","journal-title":"IEEE Trans. on Software Engineering SE"},{"key":"14_CR19","first-page":"603","volume":"4","author":"O. Cicchello","year":"2003","unstructured":"Cicchello, O., Kremer, S.: Inducing grammars from sparse data sets: A survey of algorithms and results. Journal of Machine Learning Research\u00a04, 603\u2013632 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Cheng, K., Krishnakumar, A.: Automatic functional test generation using the extended finite state machine model. In: 30th ACM\/IEEE Design Automation Conference, pp. 86\u201391 (1993)","DOI":"10.1145\/157485.164585"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Walkinshaw, N., Bogdanov, K.: Inferring Finite-State Models with Temporal Constraints. In: Proceedings of the 23rd International Conference on Automated Software Engineering, ASE (2008)","DOI":"10.1109\/ASE.2008.35"},{"key":"14_CR22","first-page":"83","volume-title":"Proceedings of the 8th ACM SIGPLAN workshop on Erlang, Erlang 2009","author":"J. Paris","year":"2009","unstructured":"Paris, J., Arts, T.: Automatic testing of tcp\/ip implementations using quickcheck. In: Proceedings of the 8th ACM SIGPLAN workshop on Erlang, Erlang 2009, pp. 83\u201392. ACM, New York (2009)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Postel, J.: Transmission control protocol. Technical Report 793, DDN Network Information Center, SRI International, RFC (September 1981)","DOI":"10.17487\/rfc0793"},{"issue":"6","key":"14_CR24","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1145\/62959.62964","volume":"31","author":"T. Ostrand","year":"1988","unstructured":"Ostrand, T., Balcer, M.: The category-partition method for specifying and generating functional tests. Communications of the ACM\u00a031(6), 676\u2013686 (1988)","journal-title":"Communications of the ACM"},{"issue":"12","key":"14_CR25","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1109\/TSE.2005.138","volume":"31","author":"C. Damas","year":"2005","unstructured":"Damas, C., Lambeau, B., Dupont, P., van Lamsweerde, A.: Generating Annotated Behavior Models from End-User Scenarios. IEEE Transactions on Software Engineering\u00a031(12), 1056\u20131073 (2005)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"14_CR26","first-page":"501","volume-title":"Proceedings of the 30th international conference on Software engineering, ICSE 2008","author":"D. Lorenzoli","year":"2008","unstructured":"Lorenzoli, D., Mariani, L., Pezz\u00e8, M.: Automatic generation of software behavioral models. In: Proceedings of the 30th international conference on Software engineering, ICSE 2008, pp. 501\u2013510. ACM, New York (2008)"},{"issue":"2","key":"14_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/32.908957","volume":"27","author":"M. Ernst","year":"2001","unstructured":"Ernst, M., Cockrell, J., Griswold, W., Notkin, D.: Dynamically Discovering Likely Program Invariants to Support Program Evolution. Transactions on Software Engineering\u00a027(2), 1\u201325 (2001)","journal-title":"Transactions on Software Engineering"},{"issue":"4","key":"14_CR28","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/TEVC.2005.850293","volume":"9","author":"J.C. Bongard","year":"2005","unstructured":"Bongard, J.C., Lipson, H.: Nonlinear system identification using coevolution of models and tests. IEEE Trans. Evolutionary Computation\u00a09(4), 361\u2013384 (2005)","journal-title":"IEEE Trans. Evolutionary Computation"},{"issue":"12","key":"14_CR29","doi-asserted-by":"publisher","first-page":"2252","DOI":"10.1016\/j.jss.2008.02.068","volume":"81","author":"B. Cornelissen","year":"2008","unstructured":"Cornelissen, B., Zaidman, A., Holten, D., Moonen, L., van Deursen, A., van Wijk, J.: Execution trace analysis through massive sequence and circular bundle views. Journal of Systems and Software\u00a081(12), 2252\u20132268 (2008)","journal-title":"Journal of Systems and Software"},{"key":"14_CR30","unstructured":"Afshan, S., McMinn, P., Walkinshaw, N.: Using dictionary compression algorithms to identify phases in program traces. Technical Report CS-10-01, Department of Computer Science, The University of Sheffield (2010)"},{"key":"14_CR31","volume-title":"Proceedings of the Eighth International Workshop on Dynamic Analysis (WODA 2010)","author":"N. Walkinshaw","year":"2010","unstructured":"Walkinshaw, N., Afshan, S., McMinn, P.: Using compression algorithms to support the comprehension of program traces. In: Proceedings of the Eighth International Workshop on Dynamic Analysis (WODA 2010). ACM, New York (2010)"},{"issue":"2\/3","key":"14_CR32","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1093\/comjnl\/40.2_and_3.103","volume":"40","author":"C. Nevill-Manning","year":"1997","unstructured":"Nevill-Manning, C., Witten, I.: Compression and explanation using hierarchical grammars. Computer Journal\u00a040(2\/3), 103\u2013116 (1997)","journal-title":"Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17071-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T18:28:22Z","timestamp":1592072902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17071-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642170706","9783642170713"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17071-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}