{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:40:14Z","timestamp":1743046814598,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031212123"},{"type":"electronic","value":"9783031212130"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21213-0_9","type":"book-chapter","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T06:08:19Z","timestamp":1670652499000},"page":"134-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Contract-Based Semantics and\u00a0Refinement for\u00a0Simulink"],"prefix":"10.1007","author":[{"given":"Quan","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,11]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Benveniste, A., et al.: Contracts for system design (2018)","DOI":"10.1561\/9781680834031"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-24559-6_21","volume-title":"Formal Methods and Software Engineering","author":"P Bostr\u00f6m","year":"2011","unstructured":"Bostr\u00f6m, P.: Contract-based verification of Simulink models. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol. 6991, pp. 291\u2013306. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24559-6_21"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-75292-9_6","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2007","author":"P Bostr\u00f6m","year":"2007","unstructured":"Bostr\u00f6m, P., Morel, L., Wald\u00e9n, M.: Stepwise development of Simulink models using the refinement calculus framework. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 79\u201393. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75292-9_6"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1007\/s10270-015-0477-x","volume":"15","author":"P Bostr\u00f6m","year":"2016","unstructured":"Bostr\u00f6m, P., Wiik, J.: Contract-based verification of discrete-time multi-rate Simulink models. Softw. Syst. Model. 15(4), 1141\u20131161 (2016)","journal-title":"Softw. Syst. Model."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bouissou, O., Chapoutot, A.: An operational semantics for Simulink\u2019s simulation engine. In: Wilhelm, R., Falk, H., Yi, W. (eds.) SIGPLAN\/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2012, LCTES 2012, Beijing, China, 12\u201313 June 2012, pp. 129\u2013138. ACM (2012)","DOI":"10.1145\/2248418.2248437"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bourke, T., Carcenac, F., Cola\u00e7o, J., Pagano, B., Pasteur, C., Pouzet, M.: A synchronous look at the Simulink standard library. ACM Trans. Embed. Comput. Syst. 16(5s), 176:1\u2013176:24 (2017)","DOI":"10.1145\/3126516"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-45212-6_7","volume-title":"Embedded Software","author":"P Caspi","year":"2003","unstructured":"Caspi, P., Curic, A., Maignan, A., Sofronis, C., Tripakis, S.: Translating discrete-time Simulink to Lustre. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 84\u201399. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45212-6_7"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/11526841_18","volume-title":"FM 2005: Formal Methods","author":"A Cavalcanti","year":"2005","unstructured":"Cavalcanti, A., Clayton, P., O\u2019Halloran, C.: Control law diagrams in Circus. In: Fitzgerald, J., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol. 3582, pp. 253\u2013268. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11526841_18"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-39698-4_6","volume-title":"Theories of Programming and Formal Methods","author":"A Cavalcanti","year":"2013","unstructured":"Cavalcanti, A., Mota, A., Woodcock, J.: Simulink timed models for program verification. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) Theories of Programming and Formal Methods. LNCS, vol. 8051, pp. 82\u201399. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39698-4_6"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Chapoutot, A., Martel, M.: Abstract simulation: a static analysis of Simulink models. In: Chen, T., Serpanos, D.N., Taha, W. (eds.) International Conference on Embedded Software and Systems, ICESS 2009, Hangzhou, Zhejiang, P.R. China, 25\u201327 May 2009, pp. 83\u201392. IEEE Computer Society (2009)","DOI":"10.1109\/ICESS.2009.80"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/11901433_5","volume-title":"Formal Methods and Software Engineering","author":"C Chen","year":"2006","unstructured":"Chen, C., Dong, J.S.: Applying timed interval calculus to Simulink diagrams. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 74\u201393. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11901433_5"},{"issue":"5","key":"9_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00165-009-0108-9","volume":"21","author":"C Chen","year":"2009","unstructured":"Chen, C., Dong, J.S., Sun, J.: A formal framework for modeling and validating Simulink diagrams. Formal Aspects Comput. 21(5), 451\u2013483 (2009)","journal-title":"Formal Aspects Comput."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-32582-8_3","volume-title":"Model Checking Software","author":"I Dragomir","year":"2016","unstructured":"Dragomir, I., Preoteasa, V., Tripakis, S.: Compositional semantics and analysis of hierarchical block diagrams. In: Bo\u0161na\u010dki, D., Wijs, A. (eds.) SPIN 2016. LNCS, vol. 9641, pp. 38\u201356. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32582-8_3"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.tcs.2019.09.017","volume":"802","author":"S Foster","year":"2020","unstructured":"Foster, S., Cavalcanti, A., Canham, S., Woodcock, J., Zeyda, F.: Unifying theories of reactive design contracts. Theor. Comput. Sci. 802, 105\u2013140 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR15","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes, vol. 178. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"9_CR16","unstructured":"MathWorks: Simulink user\u2019s guide (2021)"},{"issue":"10","key":"9_CR17","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/2.161279","volume":"25","author":"B Meyer","year":"1992","unstructured":"Meyer, B.: Applying \u201cdesign by contract\u2019\u2019. Computer 25(10), 40\u201351 (1992)","journal-title":"Computer"},{"key":"9_CR18","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency, vol. 84. Prentice Hall, Englewood Cliffs (1989)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Rajhans, A., Avadhanula, S., Chutinan, A., Mosterman, P.J., Zhang, F.: Graphical modeling of hybrid dynamics with Simulink and Stateflow. In: Prandini, M., Deshmukh, J.V. (eds.) Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week), HSCC 2018, Porto, Portugal, 11\u201313 April 2018, pp. 247\u2013252. ACM (2018)","DOI":"10.1145\/3178126.3178152"},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.3166\/ejc.18.217-238","volume":"18","author":"A Sangiovanni-Vincentelli","year":"2012","unstructured":"Sangiovanni-Vincentelli, A., Damm, W., Passerone, R.: Taming Dr. Frankenstein: contract-based design for cyber-physical systems. Eur. J. Control 18(3), 217\u2013238 (2012)","journal-title":"Eur. J. Control"},{"key":"9_CR21","unstructured":"Ye, K., Foster, S., Woodcock, J.: Compositional assume-guarantee reasoning of control law diagrams using UTP (2018). https:\/\/eprints.whiterose.ac.uk\/129640\/15\/Compositional_Assume_Guarantee_Reasoning_of_Control_Law_Diagrams_using_UTP_Tech_Report.pdf. Accessed 3 Apr 2022"},{"key":"9_CR22","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-15792-0_10","volume-title":"From Astrophysics to Unconventional Computation","author":"K Ye","year":"2020","unstructured":"Ye, K., Foster, S., Woodcock, J.: Compositional assume-guarantee reasoning of control law diagrams using UTP. In: Adamatzky, A., Kendon, V. (eds.) From Astrophysics to Unconventional Computation. ECC, vol. 35, pp. 215\u2013254. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-15792-0_10"},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10626-010-0096-1","volume":"22","author":"C Zhou","year":"2012","unstructured":"Zhou, C., Kumar, R.: Semantic translation of Simulink diagrams to input\/output extended finite automata. Discret. Event Dyn. Syst. 22(2), 223\u2013247 (2012)","journal-title":"Discret. Event Dyn. Syst."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Zou, L., Zhan, N., Wang, S., Fr\u00e4nzle, M., Qin, S.: Verifying Simulink diagrams via a hybrid Hoare logic prover. In: Ernst, R., Sokolsky, O. (eds.) Proceedings of the International Conference on Embedded Software, EMSOFT 2013, Montreal, QC, Canada, 29 September\u20134 October 2013, pp. 9:1\u20139:10. IEEE (2013)","DOI":"10.1109\/EMSOFT.2013.6658587"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21213-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T06:15:25Z","timestamp":1670652925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21213-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031212123","9783031212130"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21213-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2022","order":10,"name":"conference_id","label":"Conference ID","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":"29","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":"11","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":"3","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":"38% - 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":"4","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":"3","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)"}}]}}