{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:25Z","timestamp":1725487105144},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540731955"},{"type":"electronic","value":"9783540731962"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73196-2_3","type":"book-chapter","created":{"date-parts":[[2007,7,6]],"date-time":"2007-07-06T04:50:02Z","timestamp":1183697402000},"page":"35-49","source":"Crossref","is-referenced-by-count":0,"title":["Recovering Repetitive Sub-functions from Observations"],"prefix":"10.1007","author":[{"given":"Guy-Vincent","family":"Jourdan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasan","family":"Ural","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H\u00fcsn\u00fc","family":"Yenig\u00fcn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"ITU Telecommunication Standardization Sector: ITU-T Recommendation Z.120. Message Sequence Charts (MSC96) (1996)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Rudolph, E., Graubmann, P., Gabowski, J.: Tutorial on message sequence charts. Computer Networks and ISDN Systems\u2013SDL and MSC 28 (1996)","DOI":"10.1016\/0169-7552(95)00122-0"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Uchitel, S., Kramer, J., Magee, J.: Detecting implied scenarios in message sequence chart specifications. In: 9th European Software Engineering Conferece and 9th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (ESEC\/FSE\u201901) (2001)","DOI":"10.1145\/503209.503220"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/TSE.2003.1214326","volume":"29","author":"R. Alur","year":"2003","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. IEEE Transactions on Software Engineering\u00a029, 623\u2013633 (2003)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/52.43044","volume":"7","author":"E. Chikofsky","year":"1990","unstructured":"Chikofsky, E., Cross, J.: Reverse engineering and design recovery. IEEE Software\u00a07, 13\u201317 (1990)","journal-title":"IEEE Software"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Lee, D., Sabnani, K.: Reverse engineering of communication protocols. In: IEEE ICNP\u201993, pp. 208\u2013216 (1993)","DOI":"10.1109\/ICNP.1993.340917"},{"key":"3_CR7","unstructured":"Braberman, V., Oliveto, F., Blaunstein, S.: Scenario-based validation and verification for real-time software: On run conformance and coverage for msc-graphs. In: 2nd International Workshop on Scenarios and State Machines: Models, Algorithms, and Tools, ICSE 2003 (2003)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-30232-2_9","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2004","author":"H. Ural","year":"2004","unstructured":"Ural, H., Yenigun, H.: Towards design recovery from observations. In: de Frutos-Escrig, D., N\u00fa\u00f1ez, M. (eds.) FORTE 2004. LNCS, vol.\u00a03235, pp. 133\u2013149. Springer, Heidelberg (2004)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1007\/11569596_97","volume-title":"Computer and Information Sciences - ISCIS 2005","author":"G.V. Jourdan","year":"2005","unstructured":"Jourdan, G.V., Ural, H., Yenigun, H.: Recovering the lattice of repetitive sub-functions. In: Yolum, p., G\u00fcng\u00f6r, T., G\u00fcrgen, F., \u00d6zturan, C. (eds.) ISCIS 2005. LNCS, vol.\u00a03733, pp. 956\u2013965. Springer, Heidelberg (2005)"},{"key":"3_CR10","first-page":"70","volume":"17","author":"R. Alur","year":"1996","unstructured":"Alur, R., Holzmann, G.J., Peled, D.: An analyzer for message sequence charts. Software Concepts and Tools\u00a017, 70\u201377 (1996)","journal-title":"Software Concepts and Tools"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Abdallah, H., Leue, S.: Syntactic detection of progress divergence and non\u2013local choice in message sequence charts. In: 2nd TACAS, pp. 259\u2013274 (1997)","DOI":"10.1007\/BFb0035393"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48320-9_10","volume-title":"10th International Conference on Concurrency Theory","author":"R. Alur","year":"1999","unstructured":"Alur, R., Yannakakis, M.: Model checking of message sequence charts. In: 10th International Conference on Concurrency Theory, pp. 114\u2013129. Springer, Heidelberg (1999)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. In: 22nd International Conference on Software Engineering, pp. 304\u2013313 (2000)","DOI":"10.1145\/337180.337215"},{"key":"3_CR14","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73196-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T04:18:02Z","timestamp":1556597882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73196-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540731955","9783540731962"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73196-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}