{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:01:35Z","timestamp":1764784895396,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031067723"},{"type":"electronic","value":"9783031067730"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06773-0_9","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"175-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Hierarchical Contract-Based Synthesis for\u00a0Assurance Cases"],"prefix":"10.1007","author":[{"given":"Timothy E.","family":"Wang","sequence":"first","affiliation":[]},{"given":"Zamira","family":"Daw","sequence":"additional","affiliation":[]},{"given":"Pierluigi","family":"Nuzzo","sequence":"additional","affiliation":[]},{"given":"Alessandro","family":"Pinto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"issue":"1\u20132","key":"9_CR1","first-page":"1","volume":"4","author":"S Gulwani","year":"2017","unstructured":"Gulwani, S., Polozov, O., Singh, R., et al.: Program synthesis. Found. Trends Programm. Lang. 4(1\u20132), 1\u2013119 (2017)","journal-title":"Found. Trends Programm. Lang."},{"unstructured":"Church, A.: Application of recursive arithmetic to the problem of circuit synthesis. J. Symbol. Logic 28(4) (1963)","key":"9_CR2"},{"unstructured":"Turing, A.M.: Checking a large routine. In: Report of a Conference on High Speed Automatic Calculating Machines, pp. 67\u201369 (1949)","key":"9_CR3"},{"unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive theorem proving and program development: Coq\u2019Art: the calculus of inductive constructions. Springer Science & Business Media (2013)","key":"9_CR4"},{"issue":"10","key":"9_CR5","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1109\/TCAD.2019.2963255","volume":"39","author":"P Nuzzo","year":"2020","unstructured":"Nuzzo, P., Bajaj, N., Masin, M., Kirov, D., Passerone, R., Sangiovanni-Vincentelli, A.L.: Optimized selection of reliable and cost-effective safety-critical system architectures. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 39(10), 2109\u20132123 (2020)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"issue":"2104","key":"9_CR6","doi-asserted-by":"publisher","first-page":"20150403","DOI":"10.1098\/rsta.2015.0403","volume":"375","author":"C David","year":"2017","unstructured":"David, C., Kroening, D.: Program synthesis: challenges and opportunities. Philos. Trans. Royal Soc. A: Math. Phys. Eng. Sci. 375(2104), 20150403 (2017)","journal-title":"Philos. Trans. Royal Soc. A: Math. Phys. Eng. Sci."},{"doi-asserted-by":"crossref","unstructured":"Alur, R., et al.: Syntax-guided synthesis. IEEE (2013)","key":"9_CR7","DOI":"10.1109\/FMCAD.2013.6679385"},{"unstructured":"Benveniste, A., et al.: Contracts for system design. PhD thesis, Inria (2012)","key":"9_CR8"},{"unstructured":"Sebastian, S., et al.: Moving from specifications to contracts in component-based design. In: Fundamental Approaches to Software Engineering (2012)","key":"9_CR9"},{"doi-asserted-by":"crossref","unstructured":"Sangiovanni-Vincentelli, A., Damm, W., Passerone, R.: Taming dr. Frankenstein: Contract-based design for cyber-physical systems. Eur. J. Control 18, 217\u2013238 (2012)","key":"9_CR10","DOI":"10.3166\/ejc.18.217-238"},{"doi-asserted-by":"crossref","unstructured":"Nuzzo, P., Sangiovanni-Vincentelli, A.L., Bresolin, D., Geretti, L., Villa, T.: A platform-based design methodology with contracts and related tools for the design of cyber-physical systems. In: Proceedings of the IEEE (2015)","key":"9_CR11","DOI":"10.1109\/JPROC.2015.2453253"},{"doi-asserted-by":"crossref","unstructured":"Benveniste, A., et al.: Contracts for System Design. Werner Damm (2018)","key":"9_CR12","DOI":"10.1561\/9781680834031"},{"doi-asserted-by":"crossref","unstructured":"Pneuli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proceedings Annual Symposium on Foundations of Computer Science, pp. 746\u2013757 (1990)","key":"9_CR13","DOI":"10.1109\/FSCS.1990.89597"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-00596-1_28","volume-title":"Foundations of Software Science and Computational Structures","author":"Y Lustig","year":"2009","unstructured":"Lustig, Y., Vardi, M.Y.: Synthesis from component libraries. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 395\u2013409. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_28"},{"doi-asserted-by":"crossref","unstructured":"Iannopollo, A., Nuzzo, P., Tripakis, S., Sangiovanni-Vincentelli, A.: Library-based scalable refinement checking for contract-based design. In: 2014 Design, Automation Test in Europe Conference Exhibition (DATE) (2014)","key":"9_CR15","DOI":"10.7873\/DATE.2014.167"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.scico.2018.10.003","volume":"171","author":"A Iannopollo","year":"2019","unstructured":"Iannopollo, A., Tripakis, S., Sangiovanni-Vincentelli, A.: Constrained synthesis from component libraries. Sci. Comput. Programm. 171, 21\u201341 (2019)","journal-title":"Sci. Comput. Programm."},{"doi-asserted-by":"crossref","unstructured":"Iannopollo, A., Tripakis, S., Sangiovanni-Vincentelli, A.: Specification decomposition for synthesis from libraries of LTL assume\/guarantee contracts. In: Design, Automation Test in Europe Conference Exhibition (DATE), pp. 1574\u20131579 (2018)","key":"9_CR17","DOI":"10.23919\/DATE.2018.8342266"},{"doi-asserted-by":"publisher","unstructured":"Barrett, C., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Model Checking, pp. 305\u2013343. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_11","key":"9_CR18","DOI":"10.1007\/978-3-319-10575-8_11"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"unstructured":"Kelly, T., Weaver, R.: The goal structuring notation-a safety argument notation. In: Proceedings of the Dependable Systems and Networks 2004 Workshop on Assurance Cases, p. 6. Citeseer (2004)","key":"9_CR20"},{"unstructured":"Holloway, C.M.: Understanding the Overarching Properties. NASA Langley Research Center (2019)","key":"9_CR21"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06773-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T14:23:46Z","timestamp":1727274226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-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":"20 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pasadena, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2022\/","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":"118","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":"33","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":"6","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":"28% - 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.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}