{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:40:51Z","timestamp":1759333251933,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"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_36","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"674-692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hypercontracts"],"prefix":"10.1007","author":[{"given":"Inigo","family":"Incer","sequence":"first","affiliation":[]},{"given":"Albert","family":"Benveniste","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Sangiovanni-Vincentelli","sequence":"additional","affiliation":[]},{"given":"Sanjit A.","family":"Seshia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"M Abadi","year":"1993","unstructured":"Abadi, M., Lamport, L.: Composing specifications. ACM Trans. Program. Lang. Syst. 15(1), 73\u2013132 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Bartocci, E., Ferr\u00e8re, T., Henzinger, T.A., Nickovic, D., da Costa, A.O.: Information-flow interfaces. In: International Conference on Fundamental Approaches to Software Engineering, pp. 3\u201322 (2020)","DOI":"10.1007\/978-3-030-99429-7_1"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-28872-2_3","volume-title":"Fundamental Approaches to Software Engineering","author":"SS Bauer","year":"2012","unstructured":"Bauer, S.S., et al.: Moving from specifications to contracts in component-based design. In: de Lara, J., Zisman, A. (eds.) FASE 2012. LNCS, vol. 7212, pp. 43\u201358. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28872-2_3"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.scico.2013.06.003","volume":"83","author":"SS Bauer","year":"2014","unstructured":"Bauer, S.S., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: A modal specification theory for components with data. Sci. Comput. Program. 83, 106\u2013128 (2014)","journal-title":"Sci. Comput. Program."},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-92188-2_9","volume-title":"Formal Methods for Components and Objects","author":"A Benveniste","year":"2008","unstructured":"Benveniste, A., Caillaud, B., Ferrari, A., Mangeruca, L., Passerone, R., Sofronis, C.: Multiple viewpoint contract-based specification and design. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2007. LNCS, vol. 5382, pp. 200\u2013225. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92188-2_9"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Benveniste, A., et al.: Contracts for system design. Found. Trends Electron. Des. Autom. 12(2\u20133), 124\u2013400 (2018)","DOI":"10.1561\/1000000053"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Bujtor, J., Vogler, W.: Error-pruning in interface automata. In: 40th International Conference on Current Trends in Theory and Practice of Computer Science SOFSEM 2014, pp. 162\u2013173, Novy Smokovec, Slovakia, 26-29 January 2014","DOI":"10.1007\/978-3-319-04298-5_15"},{"issue":"6","key":"36_CR8","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010)","journal-title":"J. Comput. Secur."},{"issue":"4","key":"36_CR9","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1093\/logcom\/exm030","volume":"17","author":"JW Coleman","year":"2007","unstructured":"Coleman, J.W., Jones, C.B.: A structural proof of the soundness of rely\/guarantee rules. J. Log. Comput. 17(4), 807\u2013841 (2007)","journal-title":"J. Log. Comput."},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Proceedings of the 8th European Software Engineering Conference Held Jointly with 9th ACM SIGSOFT International Symposium on Foundations of Software Engineering, ESEC\/FSE-9, pp. 109\u2013120. ACM New York, NY, USA (2001)","DOI":"10.1145\/503209.503226"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-45449-7_11","volume-title":"Embedded Software","author":"L de Alfaro","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface theories for component-based design. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 148\u2013165. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45449-7_11"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Doyen, L., Henzinger, T.A., Jobstmann, B., Petrov, T.: Interface theories with component reuse. In: Proceedings of the 8th ACM & IEEE International conference on Embedded software, EMSOFT 2008, pp. 79\u201388, Atlanta, GA(2008)","DOI":"10.1145\/1450058.1450070"},{"issue":"3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/s10703-019-00334-z","volume":"54","author":"B Finkbeiner","year":"2019","unstructured":"Finkbeiner, B., Hahn, C., Stenger, M., Tentrup, L.: Monitoring hyperproperties. Formal Meth. Syst. Des. 54(3), 336\u2013363 (2019). https:\/\/doi.org\/10.1007\/s10703-019-00334-z","journal-title":"Formal Meth. Syst. Des."},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: 1982 IEEE Symposium on Security and Privacy, Oakland, CA, USA, 26\u201328 April 1982, pp. 11\u201320, Oakland, CA, USA, 1982. IEEE Computer Society (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-02928-9_1","volume-title":"Engineering Trustworthy Software Systems","author":"IJ Hayes","year":"2018","unstructured":"Hayes, I.J., Jones, C.B.: A guide to rely\/guarantee thinking. In: Bowen, J.P., Liu, Z., Zhang, Z. (eds.) SETSS 2017. LNCS, vol. 11174, pp. 1\u201338. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02928-9_1"},{"key":"36_CR16","series-title":"Automata, Logics, and Formal Verification, Brussels, Belgium, September 21\u201322, 2020, volume 326 of Electronic Proceedings in Theoretical Computer Science","first-page":"216","volume-title":"Proceedings 11th International Symposium on Games","author":"I Incer","year":"2020","unstructured":"Incer, I., Mangeruca, L., Villa, T., Sangiovanni-Vincentelli, A.L.: The quotient in preorder theories. In: Raskin, J.-F., Bresolin, D. (eds.) Proceedings 11th International Symposium on Games. Automata, Logics, and Formal Verification, Brussels, Belgium, September 21\u201322, 2020, volume 326 of Electronic Proceedings in Theoretical Computer Science, pp. 216\u2013233. Open Publishing Association, Brussels, Belgium (2020)"},{"key":"36_CR17","unstructured":"Jones, C.B.: Specification and design of (parallel) programs. In: IFIP Congress, pp. 321\u2013332, Paris, France (1983)"},{"key":"36_CR18","doi-asserted-by":"publisher","unstructured":"Jones, C.B.: Wanted: a compositional approach to concurrency. In: McIver, A., Morgan, C. (eds), Programming Methodology, pp. 5\u201315, New York, NY, 2003. Springer, New York. https:\/\/doi.org\/10.1007\/978-0-387-21798-7_1","DOI":"10.1007\/978-0-387-21798-7_1"},{"key":"36_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/11813040_7","volume-title":"FM 2006: Formal Methods","author":"KG Larsen","year":"2006","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: Interface input\/output automata. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 82\u201397. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11813040_7"},{"key":"36_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-71316-6_6","volume-title":"Programming Languages and Systems","author":"KG Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: Modal I\/O automata for interface and product line theories. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 64\u201379. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_6"},{"key":"36_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-74407-8_8","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"KG Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: On modal refinement and consistency. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 105\u2013119. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74407-8_8"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"L\u00fcttgen, G., Vogler, W.: Modal interface automata. Logic. Meth. Comput. Sci. 9(3) (2013)","DOI":"10.2168\/LMCS-9(3:4)2013"},{"key":"36_CR23","series-title":"pp","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-319-99725-4_17","volume-title":"Static Analysis","author":"I Mastroeni","year":"2018","unstructured":"Mastroeni, I., Pasqua, M.: Verifying bounded subset-closed hyperproperties. In: Podelski, A. (ed.) Static Analysis. pp, pp. 263\u2013283. Springer International Publishing, Cham (2018)"},{"key":"36_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-44618-4_16","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"R Negulescu","year":"2000","unstructured":"Negulescu, R.: Process spaces. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 199\u2013213. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_16"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Passerone, R., Incer, I., Sangiovanni-Vincentelli, A.L.: Coherent extension, composition, and merging operators in contract models for system design. ACM Trans. Embed. Comput. Syst. 18(5s) (2019)","DOI":"10.1145\/3358216"},{"key":"36_CR26","unstructured":"Phan-Minh, T.: Contract-Based Design: Theories and Applications. PhD thesis, California Institute of Technology (2021)"},{"key":"36_CR27","volume-title":"Contracts of Reactivity","author":"T Phan-Minh","year":"2019","unstructured":"Phan-Minh, T., Murray, R.M.: Contracts of Reactivity. Technical report, California Institute of Technology (2019)"},{"key":"36_CR28","unstructured":"Rabe, M.N.: A temporal logic approach to information-flow control. PhD thesis, Universit\u00e4t des Saarlandes (2016)"},{"key":"36_CR29","doi-asserted-by":"crossref","unstructured":"Raclet, J.-B., Badouel, E., Benveniste, A., Caillaud, B., Legay, A., Passerone, R.: Modal interfaces: Unifying interface automata and modal specifications. In: Proceedings of the Seventh ACM International Conference on Embedded Software, EMSOFT 2009, pp. 87\u201396. ACM New York, NY, USA (2009)","DOI":"10.1145\/1629335.1629348"},{"key":"36_CR30","doi-asserted-by":"crossref","unstructured":"Sangiovanni-Vincentelli, A.L., Damm, W., Passerone, R., Frankenstein, T.: Contract-based design for cyber-physical systems. Eur. J. Control 18(3), 217\u2013238 (2012)","DOI":"10.3166\/ejc.18.217-238"},{"key":"36_CR31","doi-asserted-by":"crossref","unstructured":"Saoud, A., Girard, A., Fribourg, L.: On the composition of discrete and continuous-time assume-guarantee contracts for invariance. In: 16th European Control Conference, ECC, 12\u201315 June 2018, pp. 435\u2013440, Limassol, Cyprus. IEEE (2018)","DOI":"10.23919\/ECC.2018.8550622"},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"Saoud, A., Girard, A., Fribourg, L.: Assume-guarantee contracts for continuous-time systems. working paper or preprint. Automatica 134, 109910 (2021)","DOI":"10.1016\/j.automatica.2021.109910"},{"key":"36_CR33","series-title":"pp","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-01090-4_2","volume-title":"Automated Technology for Verification and Analysis","author":"SA Seshia","year":"2018","unstructured":"Seshia, S.A., et al.: Formal specification for deep neural networks. In: Lahiri, S.K., Wang, C. (eds.) Automated Technology for Verification and Analysis. pp, pp. 20\u201334. Springer International Publishing, Cham (2018)"}],"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_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T11:14:25Z","timestamp":1659352465000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_36","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)"}}]}}