{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:11:52Z","timestamp":1725541912562},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_40","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T09:04:58Z","timestamp":1260176698000},"page":"477-488","source":"Crossref","is-referenced-by-count":2,"title":["Accelerating Smart Play-Out"],"prefix":"10.1007","author":[{"given":"David","family":"Harel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hillel","family":"Kugler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahar","family":"Maoz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itai","family":"Segall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"40_CR1","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 Trans. Software Eng.\u00a029(7), 623\u2013633 (2003)","journal-title":"IEEE Trans. Software Eng."},{"issue":"2-3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.scico.2004.04.003","volume":"54","author":"M. Broy","year":"2005","unstructured":"Broy, M.: A Semantic and Methodological Essence of Message Sequence Charts. Sci. Comput. Program.\u00a054(2-3), 213\u2013256 (2005)","journal-title":"Sci. Comput. Program."},{"issue":"1","key":"40_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1023\/A:1011227529550","volume":"19","author":"W. Damm","year":"2001","unstructured":"Damm, W., Harel, D.: LSCs: Breathing Life into Message Sequence Charts. J. on Form. Meth. in Sys. Design\u00a019(1), 45\u201380 (2001)","journal-title":"J. on Form. Meth. in Sys. Design"},{"key":"40_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-19029-2","volume-title":"Come Let\u2019s Play: Scenario-Based Programming Using LSCs and the Play-Engine","author":"D. Harel","year":"2003","unstructured":"Harel, D., Marelly, R.: Come Let\u2019s Play: Scenario-Based Programming Using LSCs and the Play-Engine. Springer, Heidelberg (2003)"},{"issue":"2","key":"40_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TSE.2003.1178048","volume":"29","author":"S. Uchitel","year":"2003","unstructured":"Uchitel, S., Kramer, J., Magee, J.: Synthesis of Behavioral Models from Scenarios. IEEE Trans. Software Eng.\u00a029(2), 99\u2013115 (2003)","journal-title":"IEEE Trans. Software Eng."},{"unstructured":"ITU: International Telecommunication Union Recommendation Z.120: Message Sequence Charts. Technical report (1996)","key":"40_CR6"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/3-540-36126-X_23","volume-title":"Formal Methods in Computer-Aided Design","author":"D. Harel","year":"2002","unstructured":"Harel, D., Kugler, H., Marelly, R., Pnueli, A.: Smart Play-out of Behavioral Requirements. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol.\u00a02517, pp. 378\u2013398. Springer, Heidelberg (2002)"},{"key":"40_CR8","first-page":"208","volume-title":"Perspectives in Concurrency Theory (Festschrift for P.S.\u00a0Thiagarajan)","author":"D. Harel","year":"2009","unstructured":"Harel, D., Kugler, H., Maoz, S., Segall, I.: How Hard is Smart Play-Out? On the Complexity of Verification-Driven Execution. In: Perspectives in Concurrency Theory (Festschrift for P.S.\u00a0Thiagarajan), pp. 208\u2013230. University Press, India (2009)"},{"key":"40_CR9","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"doi-asserted-by":"crossref","unstructured":"Harel, D., Kugler, H., Maoz, S., Segall, I.: Accelerating Smart Play-Out. Technical Report, Weizmann Institute of Science (2009)","key":"40_CR10","DOI":"10.1007\/978-3-642-11266-9_40"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-540-71209-1_37","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Harel","year":"2007","unstructured":"Harel, D., Segall, I.: Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 485\u2013499. Springer, Heidelberg (2007)"},{"issue":"2","key":"40_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10270-007-0069-5","volume":"7","author":"P. Combes","year":"2008","unstructured":"Combes, P., Harel, D., Kugler, H.: Modeling and Verification of a Telecommunication Application Using Live Sequence Charts and the Play-Engine Tool. Int. J. Soft. Sys. Mod (SoSyM)\u00a07(2), 157\u2013175 (2008)","journal-title":"Int. J. Soft. Sys. Mod. (SoSyM)"},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1145\/12276.13327","volume-title":"Proc. SIGPLAN Symp. on Compiler Construction\u00a0(CC 1986)","author":"D. Callahan","year":"1986","unstructured":"Callahan, D., Cooper, K.D., Kennedy, K., Torczon, L.: Interprocedural Constant Propagation. In: Proc. SIGPLAN Symp. on Compiler Construction\u00a0(CC 1986), pp. 152\u2013161. ACM, New York (1986)"},{"key":"40_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/186258.186514","volume-title":"Proc. ACM SIGSOFT Int. Symp. on Software Testing and Analysis (ISSTA 1994)","author":"B. Korel","year":"1994","unstructured":"Korel, B., Yalamanchili, S.: Forward Computation of Dynamic Program Slices. In: Proc. ACM SIGSOFT Int. Symp. on Software Testing and Analysis (ISSTA 1994), pp. 66\u201379. ACM, New York (1994)"},{"key":"40_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-36578-8_27","volume-title":"Fundamental Approaches to Software Engineering","author":"I. Kr\u00fcger","year":"2003","unstructured":"Kr\u00fcger, I.: Capturing Overlapping, Triggered, and Preemptive Collaborations Using MSCs. In: Pezz\u00e9, M. (ed.) FASE 2003. LNCS, vol.\u00a02621, pp. 387\u2013402. Springer, Heidelberg (2003)"},{"key":"40_CR16","volume-title":"Software Testing and Analysis: Process, Principles and Techniques","author":"M. Pezz\u00e9","year":"2008","unstructured":"Pezz\u00e9, M., Young, M.: Software Testing and Analysis: Process, Principles and Techniques. John Wiley & Sons, Chichester (2008)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T04:44:24Z","timestamp":1558673064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}