{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:46:49Z","timestamp":1725540409345},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642050886"},{"type":"electronic","value":"9783642050893"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05089-3_20","type":"book-chapter","created":{"date-parts":[[2009,11,3]],"date-time":"2009-11-03T22:31:40Z","timestamp":1257287500000},"page":"305-320","source":"Crossref","is-referenced-by-count":33,"title":["Iterative Refinement of Reverse-Engineered Models by Model-Based Testing"],"prefix":"10.1007","author":[{"given":"Neil","family":"Walkinshaw","sequence":"first","affiliation":[]},{"given":"John","family":"Derrick","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","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"},{"key":"20_CR2","unstructured":"Armstrong, J.: Programming Erlang: Software for a Concurrent World. Pragmatic Bookshelf (July 2007)"},{"key":"20_CR3","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":"20_CR4","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":"20_CR5","unstructured":"Ernst, M.: Static and Dynamic Analysis: Synergy and Duality. In: Proceedings of the International Workshop on Dynamic Analysis, WODA (2003)"},{"key":"20_CR6","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":"20_CR7","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":"20_CR8","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":"20_CR9","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"},{"issue":"3","key":"20_CR10","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":"20_CR11","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":"20_CR12","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":"20_CR13","doi-asserted-by":"crossref","unstructured":"Uchitel, S., Kramer, J., Magee, J.: Behaviour Model Elaboration using Partial Labelled Transition Systems. In: 4th joint meeting of the European Software Engineering Conference and ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC\/FSE), pp. 19\u201327 (2003)","DOI":"10.1145\/940071.940076"},{"key":"20_CR14","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"2007","unstructured":"Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley, Reading (2007)","edition":"3"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"T. Chow","year":"1978","unstructured":"Chow, T.: Testing Software Design Modelled by Finite State Machines. IEEE Transactions on Software Engineering\u00a04(3), 178\u2013187 (1978)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"20_CR16","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)"},{"issue":"2","key":"20_CR17","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"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Bogdanov, K., Walkinshaw, N.: Computing the Structural Difference between State-Based Models. In: 16th IEEE Working Conference on Reverse Engineering, WCRE (2009)","DOI":"10.1109\/WCRE.2009.17"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Walkinshaw, N., Bogdanov, K., Johnson, K.: Evaluation and Comparison of Inferred Regular Grammars. In: Proceedings of the International Colloquium on Grammar Inference (ICGI), St. Malo, France (2008)","DOI":"10.1007\/978-3-540-88009-7_20"}],"container-title":["Lecture Notes in Computer Science","FM 2009: Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05089-3_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:19:02Z","timestamp":1619781542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05089-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642050886","9783642050893"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05089-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}