{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:39:43Z","timestamp":1725853183240},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319325811"},{"type":"electronic","value":"9783319325828"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32582-8_2","type":"book-chapter","created":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T06:04:23Z","timestamp":1460009063000},"page":"19-37","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Symbolic Game Semantics for Model Checking Program Families"],"prefix":"10.1007","author":[{"given":"Aleksandar S.","family":"Dimovski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,8]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S1571-0661(05)80398-6","volume":"3","author":"S Abramsky","year":"1996","unstructured":"Abramsky, S., McCusker, G.: Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions. Electr. Notes Theor. Comput. Sci. 3, 2\u201314 (1996)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Apel, S., von Rhein, A., Wendler, P., Gr\u00f6\u00dflinger, A., Beyer, D.: Strategies for product-line verification: case studies and experiments. In: 35th International Conference on Software Engineering, ICSE 2013, pp. 482\u2013491 (2013)","DOI":"10.1109\/ICSE.2013.6606594"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Chen, S., Erwig, M., Walkingshaw, E.: An error-tolerant type system for variational lambda calculus. In: ACM SIGPLAN International Conference on Functional Programming, ICFP 2012, pp. 29\u201340. ACM (2012)","DOI":"10.1145\/2398856.2364535"},{"issue":"8","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1109\/TSE.2012.86","volume":"39","author":"A Classen","year":"2013","unstructured":"Classen, A., Cordy, M., Schobbens, P.-Y., Heymans, P., Legay, A., Raskin, J.-F.: Featured transition systems: foundations for verifying variability-intensive systems and their application to LTL model checking. IEEE Trans. Softw. Eng. 39(8), 1069\u20131089 (2013)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"2_CR5","volume-title":"Software Product Lines: Practices and Patterns","author":"P Clements","year":"2001","unstructured":"Clements, P., Northrop, L.: Software Product Lines: Practices and Patterns. Addison-Wesley, Boston (2001)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-16265-7_10","volume-title":"Integrated Formal Methods","author":"A Dimovski","year":"2010","unstructured":"Dimovski, A.: A compositional method for deciding equivalence and termination of nondeterministic programs. In: M\u00e9ry, D., Merz, S. (eds.) IFM 2010. LNCS, vol. 6396, pp. 121\u2013135. Springer, Heidelberg (2010)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11547662_9","volume-title":"Static Analysis","author":"A Dimovski","year":"2005","unstructured":"Dimovski, A., Ghica, D.R., Lazi\u0107, R.: Data-abstraction refinement: a game semantic approach. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol. 3672, pp. 102\u2013117. Springer, Heidelberg (2005)"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10009-006-0005-y","volume":"9","author":"A Dimovski","year":"2007","unstructured":"Dimovski, A., Lazic, R.: Compositional software verification based on game semantics and process algebra. STTT 9(1), 37\u201351 (2007)","journal-title":"STTT"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.tcs.2014.01.016","volume":"560","author":"AS Dimovski","year":"2014","unstructured":"Dimovski, A.S.: Program verification using symbolic game semantics. Theor. Comput. Sci. 560, 364\u2013379 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-319-23404-5_18","volume-title":"Model Checking Software","author":"AS Dimovski","year":"2015","unstructured":"Dimovski, A.S., Al-Sibahi, A.S., Brabrand, C., W\u0105sowski, A.: Family-based model checking without a family-based model checker. In: Fischer, B., Geldenhuys, J. (eds.) SPIN 2015. LNCS, vol. 9232, pp. 282\u2013299. Springer, Heidelberg (2015)"},{"key":"2_CR11","unstructured":"Dimovski, A.S., Brabrand, C., Wasowski, A.: Variability abstractions: trading precision for speed in family-based analyses. In: 29th European Conference on Object-Oriented Programming, ECOOP 2015. LIPIcs, vol. 37, pp. 247\u2013270. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"issue":"1\u20133","key":"2_CR12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0304-3975(03)00315-3","volume":"309","author":"DR Ghica","year":"2003","unstructured":"Ghica, D.R., McCusker, G.: The regular-language semantics of second-order idealized algol. Theor. Comput. Sci. 309(1\u20133), 469\u2013502 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/11691372_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"DR Ghica","year":"2006","unstructured":"Ghica, D.R., Murawski, A.S.: Compositional model extraction for higher-order concurrent programs. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 303\u2013317. Springer, Heidelberg (2006)"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"JME Hyland","year":"2000","unstructured":"Hyland, J.M.E., Luke Ong, C.-H.: On full abstraction for PCF: I, II, and III. Inf. Comput. 163(2), 285\u2013408 (2000)","journal-title":"Inf. Comput."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-78800-3_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Legay","year":"2008","unstructured":"Legay, A., Murawski, A.S., Ouaknine, J., Worrell, J.: On automated verification of probabilistic programs. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 173\u2013187. Springer, Heidelberg (2008)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-31982-5_13","volume-title":"Foundations of Software Science and Computational Structures","author":"AS Murawski","year":"2005","unstructured":"Murawski, A.S., Walukiewicz, I.: Third-order idealized Algol with iteration is decidable. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 202\u2013218. Springer, Heidelberg (2005)"},{"key":"2_CR17","volume-title":"Algol-like Languages","author":"JC Reynolds","year":"1997","unstructured":"Reynolds, J.C.: The essence of Algol. In: O\u2019Hearn, P.W., Tennent, R.D. (eds.) Algol-like Languages. Birkha\u00fcser, Basel (1997)"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2580950","volume":"47","author":"T Th\u00fcm","year":"2014","unstructured":"Th\u00fcm, T., Apel, S., K\u00e4stner, C., Schaefer, I., Saake, G.: A classification and survey of analysis strategies for software product lines. ACM Comput. Surv. 47(1), 6 (2014)","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32582-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T21:17:33Z","timestamp":1584998253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32582-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319325811","9783319325828"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32582-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}