{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:00:30Z","timestamp":1761930030694,"version":"3.37.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304454"},{"type":"electronic","value":"9783030304461"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30446-1_22","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:03:18Z","timestamp":1567969398000},"page":"410-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Modular Indirect Push-Button Formal Verification of Multi-threaded Code Generators"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2071-9624","authenticated-orcid":false,"given":"Anton","family":"Wijs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Wi\u0142kowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-16145-2_12","volume-title":"Model Driven Engineering Languages and Systems","author":"L Ab Rahim","year":"2010","unstructured":"Ab Rahim, L., Whittle, J.: Verifying semantic conformance of State Machine-to-Java code generators. In: Petriu, D.C., Rouquette, N., Haugen, \u00d8. (eds.) MODELS 2010. LNCS, vol. 6394, pp. 166\u2013180. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16145-2_12"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1007\/s10270-013-0358-0","volume":"14","author":"L Ab Rahim","year":"2013","unstructured":"Ab Rahim, L., Whittle, J.: A survey of approaches for verifying model transformations. Softw. Syst. Model. 14, 1003\u20131028 (2013)","journal-title":"Softw. Syst. Model."},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195881","volume-title":"Modeling in Event-B: System and Software Engineering","author":"JR Abrial","year":"2010","unstructured":"Abrial, J.R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press, Cambridge (2010)"},{"issue":"1\u20132","key":"22_CR4","first-page":"1","volume":"11","author":"A Amighi","year":"2015","unstructured":"Amighi, A., Haack, C., Huisman, M., Hurlin, C.: Permission-based separation logic for multithreaded Java programs. Log. Methods Comput. Sci. 11(1\u20132), 1\u201366 (2015)","journal-title":"Log. Methods Comput. Sci."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-73859-6_9","volume-title":"Algebra and Coalgebra in Computer Science","author":"P Baldan","year":"2007","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R., K\u00f6nig, B.: Bisimilarity and behaviour-preserving reconfigurations of open Petri Nets. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 126\u2013142. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-73859-6_9"},{"key":"22_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development: Coq\u2019 Art: The Calculus of Inductive Constructions","author":"Y Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development: Coq\u2019 Art: The Calculus of Inductive Constructions. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-662-07964-5"},{"key":"22_CR7","first-page":"49","volume":"2005","author":"J Blech","year":"2005","unstructured":"Blech, J., Glesner, S., Leitner, J.: Formal verification of Java code generation from UML models. Fujaba Days 2005, 49\u201356 (2005)","journal-title":"Fujaba Days"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-66845-1_7","volume-title":"Integrated Formal Methods","author":"S Blom","year":"2017","unstructured":"Blom, S., Darabi, S., Huisman, M., Oortwijn, W.: The VerCors tool set: verification of parallel and concurrent software. In: Polikarpova, N., Schneider, S. (eds.) IFM 2017. LNCS, vol. 10510, pp. 102\u2013110. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-66845-1_7"},{"issue":"6","key":"22_CR9","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1145\/3140587.3062358","volume":"52","author":"Timothy Bourke","year":"2017","unstructured":"Bourke, T., Brun, L., Dagand, P.E., Leroy, X., Pouzet, M., Rieg, L.: A formally verified compiler for Lustre. In: PLDI, ACM SIGPLAN Notices, vol. 52, pp. 586\u2013601. ACM (2017)","journal-title":"ACM SIGPLAN Notices"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-28934-2_8","volume-title":"Formal Aspects of Component Software","author":"D Bo\u0161na\u010dki","year":"2016","unstructured":"Bo\u0161na\u010dki, D., et al.: Towards modular verification of threaded concurrent executable code generated from DSL models. In: Braga, C., \u00d6lveczky, P.C. (eds.) FACS 2015. LNCS, vol. 9539, pp. 141\u2013160. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-28934-2_8"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-17465-1_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Bunte","year":"2019","unstructured":"Bunte, O., et al.: The mCRL2 toolset for analysing concurrent systems. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 21\u201339. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-17465-1_2"},{"doi-asserted-by":"crossref","unstructured":"Chaki, S., Clarke, E., Groce, A., Jha, S., Veith, H.: Modular verification of software components in C. In: ICSE, pp. 385\u2013395. IEEE (2003)","key":"22_CR12","DOI":"10.1109\/ICSE.2003.1201217"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-24644-4_21","volume-title":"Fundamentals of Software Engineering","author":"M Dalvandi","year":"2015","unstructured":"Dalvandi, M., Butler, M., Rezazadeh, A.: From Event-B models to Dafny code contracts. In: Dastani, M., Sirjani, M. (eds.) FSEN 2015. LNCS, vol. 9392, pp. 308\u2013315. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-24644-4_21"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2016.10.023","volume":"115","author":"I Dejanovi\u0107","year":"2017","unstructured":"Dejanovi\u0107, I., Vaderna, R., Milosavljevi\u0107, G., Vukovi\u0107, \u017d.: TextX: a Python tool for domain-specific languages implementation. Knowl.-Based Syst. 115, 1\u20134 (2017). \n                      https:\/\/doi.org\/10.1016\/j.knosys.2016.10.023","journal-title":"Knowl.-Based Syst."},{"issue":"6","key":"22_CR15","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s10009-014-0308-3","volume":"17","author":"D Ernst","year":"2015","unstructured":"Ernst, D., Pf\u00e4hler, J., Schellhorn, G., Haneberg, D., Reif, W.: KIV: overview and verifythis competition. Int. J. Softw. Tools Technol. Transf. 17(6), 677\u2013694 (2015)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/3060140","volume":"18","author":"J Groote","year":"2017","unstructured":"Groote, J., Jansen, D., Keiren, J., Wijs, A.: An O(m log n) algorithm for computing stuttering equivalence and branching bisimulation. ACM Trans. Comput. Log. 18(2), 13:1\u201313:34 (2017)","journal-title":"ACM Trans. Comput. Log."},{"issue":"9","key":"22_CR17","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/5.97300","volume":"79","author":"N Halbwachs","year":"1991","unstructured":"Halbwachs, N., Caspi, P., Raymond, P., Pilaud, D.: The synchronous data flow programming language LUSTRE. Proc. IEEE 79(9), 1305\u20131320 (1991)","journal-title":"Proc. IEEE"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1147\/sj.72.0074","volume":"7","author":"J Havender","year":"1968","unstructured":"Havender, J.: Avoiding deadlock in multitasking systems. IBM Syst. J. 7(2), 74\u201384 (1968)","journal-title":"IBM Syst. J."},{"unstructured":"Holzmann, G.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley Professional (2003)","key":"22_CR19"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-16265-7_14","volume-title":"Integrated Formal Methods","author":"M H\u00fclsbusch","year":"2010","unstructured":"H\u00fclsbusch, M., K\u00f6nig, B., Rensink, A., Semenyak, M., Soltenborn, C., Wehrheim, H.: Showing full semantics preservation in model transformation - a comparison of techniques. In: M\u00e9ry, D., Merz, S. (eds.) IFM 2010. LNCS, vol. 6396, pp. 183\u2013198. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16265-7_14"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-20398-5_4","volume-title":"NASA Formal Methods","author":"B Jacobs","year":"2011","unstructured":"Jacobs, B., Smans, J., Philippaerts, P., Vogels, F., Penninckx, W., Piessens, F.: VeriFast: a powerful, sound, predictable, fast verifier for C and Java. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 41\u201355. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-20398-5_4"},{"issue":"4","key":"22_CR22","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/1592434.1592438","volume":"41","author":"R Jhala","year":"2009","unstructured":"Jhala, R., Majumdar, R.: Software model checking. ACM Comput. Surv. 41(4), 21:1\u201321:54 (2009)","journal-title":"ACM Comput. Surv."},{"unstructured":"Kleppe, A., Warmer, J., Bast, W.: MDA Explained: The Model Driven Architecture: Practice and Promise. Addison-Wesley Professional (2005)","key":"22_CR23"},{"doi-asserted-by":"crossref","unstructured":"Kumar, R., Myreen, M., Norrish, M., Owens, S.: CakeML: a verified implementation of ML. In: POPL, ACM SIGPLAN Notices, vol. 49, pp. 179\u2013191. ACM (2014)","key":"22_CR24","DOI":"10.1145\/2535838.2535841"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-17511-4_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"KRM Leino","year":"2010","unstructured":"Leino, K.R.M.: Dafny: an automatic program verifier for functional correctness. In: Clarke, E.M., Voronkov, A. (eds.) LPAR 2010. LNCS (LNAI), vol. 6355, pp. 348\u2013370. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-17511-4_20"},{"issue":"7","key":"22_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1538788.1538814","volume":"52","author":"X Leroy","year":"2009","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009)","journal-title":"Commun. ACM"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-10431-7_1","volume-title":"Software Engineering and Formal Methods","author":"X Leroy","year":"2014","unstructured":"Leroy, X.: Formal proofs of code generation and verification tools. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 1\u20134. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-10431-7_1"},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-662-49122-5_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P M\u00fcller","year":"2016","unstructured":"M\u00fcller, P., Schwerhoff, M., Summers, A.J.: Viper: a verification infrastructure for permission-based reasoning. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 41\u201362. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49122-5_2"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-53479-2_17","volume-title":"Semantics of Systems of Concurrent Processes","author":"R Nicola De","year":"1990","unstructured":"De Nicola, R., Vaandrager, F.: Action versus state based logics for transition systems. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 407\u2013419. Springer, Heidelberg (1990). \n                      https:\/\/doi.org\/10.1007\/3-540-53479-2_17"},{"key":"22_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic","author":"T Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L., Wenzel, M.: Isabelle\/HOL: A Proof Assistant for Higher-Order Logic. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45949-9"},{"issue":"6","key":"22_CR31","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"22_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-73370-6_17","volume-title":"Model Checking Software","author":"R Pel\u00e1nek","year":"2007","unstructured":"Pel\u00e1nek, R.: BEEM: benchmarks for explicit model checkers. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol. 4595, pp. 263\u2013267. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-73370-6_17"},{"issue":"2","key":"22_CR33","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s100090050027","volume":"2","author":"A Pnueli","year":"1998","unstructured":"Pnueli, A., Shtrichman, O., Siegel, M.: The code validation tool CVT: automatic verification of a compilation process. Int. J. Softw. Tools Technol. Transf. 2(2), 192\u2013201 (1998)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"1","key":"22_CR34","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00165-017-0437-z","volume":"30","author":"S Putter de","year":"2018","unstructured":"de Putter, S., Wijs, A.: A formal verification technique for behavioural model-to-model transformations. Formal Aspects Comput. 30(1), 3\u201343 (2018)","journal-title":"Formal Aspects Comput."},{"key":"22_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-030-02146-7_15","volume-title":"Formal Aspects of Component Software","author":"S de Putter","year":"2018","unstructured":"de Putter, S., Wijs, A., Zhang, D.: The SLCO framework for verified, model-driven construction of component software. In: Bae, K., \u00d6lveczky, P.C. (eds.) FACS 2018. LNCS, vol. 11222, pp. 288\u2013296. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-02146-7_15"},{"issue":"1","key":"22_CR36","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1093\/comjnl\/bxs156","volume":"57","author":"M Reniers","year":"2014","unstructured":"Reniers, M., Schoren, R., Willemse, T.: Results on embeddings between state-based and event-based systems. Comput. J. 57(1), 73\u201392 (2014)","journal-title":"Comput. J."},{"key":"22_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-71067-7_6","volume-title":"Theorem Proving in Higher Order Logics","author":"K Slind","year":"2008","unstructured":"Slind, K., Norrish, M.: A brief overview of HOL4. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 28\u201332. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71067-7_6"},{"key":"22_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-88194-0_15","volume-title":"Formal Methods and Software Engineering","author":"M Staats","year":"2008","unstructured":"Staats, M., Heimdahl, M.P.E.: Partial translation verification for untrusted code-generators. In: Liu, S., Maibaum, T., Araki, K. (eds.) ICFEM 2008. LNCS, vol. 5256, pp. 226\u2013237. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-88194-0_15"},{"key":"22_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-24485-8_39","volume-title":"Model Driven Engineering Languages and Systems","author":"K Stenzel","year":"2011","unstructured":"Stenzel, K., Moebius, N., Reif, W.: Formal verification of QVT transformations for code generation. In: Whittle, J., Clark, T., K\u00fchne, T. (eds.) MODELS 2011. LNCS, vol. 6981, pp. 533\u2013547. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-24485-8_39"},{"key":"22_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-31759-0_18","volume-title":"Model Checking Software","author":"M Sulzmann","year":"2012","unstructured":"Sulzmann, M., Zechner, A.: Model checking DSL-generated C source code. In: Donaldson, A., Parker, D. (eds.) SPIN 2012. LNCS, vol. 7385, pp. 241\u2013247. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31759-0_18"},{"issue":"2","key":"22_CR41","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1022920129859","volume":"10","author":"W Visser","year":"2003","unstructured":"Visser, W., Havelund, K., Brat, G., Park, S., Lerda, F.: Model checking programs. Autom. Softw. Eng. 10(2), 203\u2013232 (2003)","journal-title":"Autom. Softw. Eng."},{"doi-asserted-by":"crossref","unstructured":"Wijs, A.: Achieving discrete relative timing with untimed process algebra. In: ICECCS, pp. 35\u201346. IEEE (2007)","key":"22_CR42","DOI":"10.1109\/ICECCS.2007.13"},{"unstructured":"Wijs, A.: What to do next?: Analysing and optimising system behaviour in time. Ph.D. thesis, VU University Amsterdam (2007)","key":"22_CR43"},{"key":"22_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-642-36742-7_41","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Wijs","year":"2013","unstructured":"Wijs, A., Engelen, L.: Efficient property preservation checking of model refinements. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 565\u2013579. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-36742-7_41"},{"unstructured":"Wijs, A., Fokkink, W.: From \n                      \n                        \n                      \n                      $$\\chi _{\\mathit{t}}$$\n                     to \n                      \n                        \n                      \n                      $$\\mu $$\n                    CRL: combining performance and functional analysis. In: ICECCS, pp. 184\u2013193. IEEE (2005)","key":"22_CR45"},{"key":"22_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-319-48989-6_42","volume-title":"FM 2016: Formal Methods","author":"A Wijs","year":"2016","unstructured":"Wijs, A., Neele, T., Bo\u0161na\u010dki, D.: GPUexplore 2.0: unleashing GPU explicit-state model checking. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 694\u2013701. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-48989-6_42"},{"key":"22_CR47","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-66302-9_13","volume-title":"Model-Driven Engineering and Software Development","author":"D Zhang","year":"2017","unstructured":"Zhang, D., et al.: Verifying atomicity preservation and deadlock freedom of a generic shared variable mechanism used in model-to-code transformations. In: Hammoudi, S., Pires, L.F., Selic, B., Desfray, P. (eds.) MODELSWARD 2016. CCIS, vol. 692, pp. 249\u2013273. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-66302-9_13"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30446-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:42:12Z","timestamp":1567971732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30446-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304454","9783030304461"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30446-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sefm2019.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}