{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:47:58Z","timestamp":1771573678926,"version":"3.50.1"},"reference-count":43,"publisher":"Elsevier","isbn-type":[{"value":"9780124080942","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1016\/b978-0-12-408094-2.00003-5","type":"book-chapter","created":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T17:43:08Z","timestamp":1363628588000},"page":"89-139","source":"Crossref","is-referenced-by-count":20,"title":["Model Inference and Testing"],"prefix":"10.1016","author":[{"given":"Muhammad","family":"Naeem Irfan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Oriat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Groz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0005","doi-asserted-by":"crossref","unstructured":"Fides Aarts, Bengt Jonsson, Johan Uijen, Generating models of infinite-state communication protocols using regular inference with abstraction, in: ICTSS, 2010, pp. 188\u2013204.","DOI":"10.1007\/978-3-642-16573-3_14"},{"issue":"2","key":"10.1016\/B978-0-12-408094-2.00003-5_b0010","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","article-title":"Learning regular sets from queries and counterexamples","volume":"75","author":"Angluin","year":"1987","journal-title":"Inf. Comput."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0015","unstructured":"Aspectwerkz, 2007. <http:\/\/aspectwerkz.codehaus.org\/>"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0020","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 L. Balc\u00e1zar, Josep D\u0131\u00b4az, Ricard Gavald\u00e1, Algorithms for learning finite automata from queries: a unified view, in: Advances in Algorithms, Languages, and, Complexity, 1997, pp. 53\u201372.","DOI":"10.1007\/978-1-4613-3394-4_2"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0025","unstructured":"Borja Balle, Implementing kearns-vazirani algorithm for learning DFA only with membership queries, in: ZULU Workshop Organised During ICGI, 2010."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0030","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.entcs.2004.12.015","article-title":"Insights to angluin\u2019s learning","volume":"118","author":"Berg","year":"2005","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0035","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TC.1972.5009015","article-title":"On the synthesis of finite-state machines from samples of their behaviour","volume":"21","author":"Biermann","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0040","unstructured":"Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker, Angluin-style learning of NFA, Research Report LSV-08-28 Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France, October 2008, p. 30."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0045","unstructured":"Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker, Angluin-style learning of NFA, in: IJCAI, 2009, pp. 1004\u20131009."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0050","doi-asserted-by":"crossref","unstructured":"Chia Yuan Cho, Domagoj Babic, Eui Chul Richard Shin, Dawn Song, Inference and analysis of formal models of botnet command and control protocols, in: ACM Conference on Computer and Communications Security, 2010, pp. 426\u2013439.","DOI":"10.1145\/1866307.1866355"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0055","doi-asserted-by":"crossref","unstructured":"David Combe, Myrtille Ponge, Colin de la Higuera, Jean-Christophe Janodet, Zulu: an interactive learning competition, in: ZULU Workshop Organised during ICGI, 2010.","DOI":"10.1007\/978-3-642-14684-8_15"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0060","doi-asserted-by":"crossref","unstructured":"Jonathan E. Cook, Alexander L. Wolf, Automating process discovery through event-data analysis, in: ICSE, 1995, pp. 73\u201382.","DOI":"10.1145\/225014.225021"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0065","doi-asserted-by":"crossref","unstructured":"Jonathan E. Cook, Artur Klauser, Alexander L. Wolf, Benjamin G. Zorn, Semi-automatic, self-adaptive control of garbage collection rates in object databases, in: SIGMOD Conference, 1996, pp. 377\u2013388.","DOI":"10.1145\/235968.233354"},{"issue":"3","key":"10.1016\/B978-0-12-408094-2.00003-5_b0070","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/287000.287001","article-title":"Discovering models of software processes from event-based data","volume":"7","author":"Cook","year":"1998","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"issue":"4","key":"10.1016\/B978-0-12-408094-2.00003-5_b0075","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3233\/FUN-2002-51402","article-title":"Residual finite state automata","volume":"51","author":"Denis","year":"2002","journal-title":"Fundam. Inform."},{"issue":"3","key":"10.1016\/B978-0-12-408094-2.00003-5_b0080","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1145\/1066100.1066102","article-title":"Simplify: a theorem prover for program checking","volume":"52","author":"Detlefs","year":"2005","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/B978-0-12-408094-2.00003-5_b0085","first-page":"469","article-title":"On the number of distinct languages accepted by finite automata with n states","volume":"7","author":"Domaratzki","year":"2002","journal-title":"J. Autom. Lang. Combin."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0090","unstructured":"Sarah Eisenstat, Dana Angluin, Learning random DFAs with membership queries: the goodsplit algorithm, in: ZULU Workshop Organised During ICGI, 2010."},{"issue":"2","key":"10.1016\/B978-0-12-408094-2.00003-5_b0095","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/32.908957","article-title":"Dynamically discovering likely program invariants to support program evolution","volume":"27","author":"Ernst","year":"2001","journal-title":"IEEE Trans. Software Eng."},{"issue":"5","key":"10.1016\/B978-0-12-408094-2.00003-5_b0100","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1093\/jigpal\/jzl007","article-title":"Adaptive model checking","volume":"14","author":"Groce","year":"2006","journal-title":"Bull. IGPL"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0105","doi-asserted-by":"crossref","unstructured":"Roland Groz, Muhammad-Naeem Irfan, Catherine Oriat, Algorithmic improvements on regular inference of software models and perspectives for security testing, in: ISoLA, vol. 1, 2012, pp. 444\u2013457.","DOI":"10.1007\/978-3-642-34026-0_33"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0110","doi-asserted-by":"crossref","unstructured":"Falk Howar, Bernhard Steffen, Maik Merten, From ZULU to RERS\u2014lessons learned in the ZULU challenge, in: ISoLA, vol. 1, 2010, pp. 687\u2013704.","DOI":"10.1007\/978-3-642-16558-0_55"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0115","doi-asserted-by":"crossref","unstructured":"Hardi Hungar, Oliver Niese, Bernhard Steffen, Domain-specific optimization in automata learning, in: CAV, 2003, pp. 315\u2013327.","DOI":"10.1007\/978-3-540-45069-6_31"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0120","series-title":"Proceedings of the First International Workshop on Model Inference in Testing, MIIT\u201910","first-page":"11","article-title":"Angluin style finite state machine inference with non-optimal counterexamples","author":"Irfan","year":"2010"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0125","unstructured":"Muhammad Naeem Irfan, Roland Groz, Catherine Oriat, Improving model inference of black box components having large input test set, in: Proceedings of the 11th International Conference on Grammatical Inference, ICGI 2012, September 2012, pp. 133\u2013138."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0130","unstructured":"JabRef. Reference Manager. <http:\/\/jabref.sourceforge.net\/>."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0135","unstructured":"jEdit. jEdit\u2014Programmer\u2019s Text Editor. <http:\/\/www.jedit.org\/>."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0140","unstructured":"K. Li, R. Groz, M. Shahbaz, Integration testing of components guided by incremental state machine learning, in: Testing: Academia and Industry Conference\u2014Practice And Research Techniques (TAIC PART 2006), 2006, pp. 59\u201370."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0145","doi-asserted-by":"crossref","unstructured":"D. Lorenzoli, L. Mariani, M. PezzF, Automatic generation of software behavioral models, in: 30th International Conference on Software Engineering (ICSE 2008), 2008, pp. 501\u2013510.","DOI":"10.1145\/1368088.1368157"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0150","doi-asserted-by":"crossref","unstructured":"Erkki M\u00e4kinen Tarja Syst\u00e4, MAS\u2014an interactive synthesizer to support behavioral modeling in UML, in: ICSE, 2001, pp. 15\u201324.","DOI":"10.1109\/ICSE.2001.919077"},{"issue":"2","key":"10.1016\/B978-0-12-408094-2.00003-5_b0155","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1006\/inco.1995.1070","article-title":"On the learnability of infinitary regular sets","volume":"118","author":"Maler","year":"1995","journal-title":"Inf. Comput."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0160","doi-asserted-by":"crossref","unstructured":"Karl Meinke, Fei Niu, A learning-based approach to unit testing of numerical software, in: ICTSS, 2010, pp. 221\u2013235.","DOI":"10.1007\/978-3-642-16573-3_16"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0165","doi-asserted-by":"crossref","unstructured":"Henry Muccini, Andrea Polini, Fabiano Ricci, Antonia Bertolino, Monitoring architectural properties in dynamic component-based systems, in: CBSE, 2007, pp. 124\u2013139.","DOI":"10.1007\/978-3-540-73551-9_9"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0170","unstructured":"Oliver Niese, An Integrated Approach to Testing Complex Systems, PhD Thesis, University of Dortmund, 2003."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0175","doi-asserted-by":"crossref","unstructured":"Doron Peled, Moshe Y. Vardi, Mihalis Yannakakis, Black box checking, in: FORTE, 1999, pp. 225\u2013240.","DOI":"10.1007\/978-0-387-35578-8_13"},{"issue":"4","key":"10.1016\/B978-0-12-408094-2.00003-5_b0180","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10009-009-0120-7","article-title":"Dynamic testing via automata learning","volume":"11","author":"Raffelt","year":"2009","journal-title":"STTT"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0185","doi-asserted-by":"crossref","unstructured":"Ronald L. Rivest, Robert E, Schapire, Inference of finite automata using homing sequences, in: Machine Learning: From Theory to Applications, 1993, pp. 51\u201373.","DOI":"10.1007\/3-540-56483-7_22"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0190","unstructured":"Muzammil Shahbaz, Reverse Engineering Enhanced State Models of Black Box Components to Support Integration Testing, PhD Thesis, Grenoble Institute of Technology, 2008."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0195","doi-asserted-by":"crossref","unstructured":"Muzammil Shahbaz, Roland Groz, Inferring mealy machines, in: FM, 2009, pp. 207\u2013222.","DOI":"10.1007\/978-3-642-05089-3_14"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0200","series-title":"ICDCS\u201907: Proceedings of the 27th International Conference on Distributed Computing Systems","first-page":"25","article-title":"Testing security properties of protocol implementations\u2014a machine learning based approach","author":"Shu","year":"2007"},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0205","unstructured":"B.A. Trakhtenbrot, Ya. M. Barzdin, Finite Automata, Behaviour and Synthesis, North-Holland, 1973."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0210","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/stvr.380","article-title":"Automated discovery of state transitions and their functions in source code","volume":"18","author":"Walkinshaw","year":"2008","journal-title":"Softw. Test. Verif. Reliab."},{"key":"10.1016\/B978-0-12-408094-2.00003-5_b0215","first-page":"169","article-title":"Learning non-deterministic finite automata from queries and counterexamples","volume":"13","author":"Yokomori","year":"1994","journal-title":"Mach. Intell."}],"container-title":["Advances in Computers"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T00:57:08Z","timestamp":1745974628000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780124080942000035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9780124080942"],"references-count":43,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-408094-2.00003-5","relation":{},"ISSN":["0065-2458"],"issn-type":[{"value":"0065-2458","type":"print"}],"subject":[],"published":{"date-parts":[[2013]]}}}