{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T00:57:07Z","timestamp":1769302627401,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030763831","type":"print"},{"value":"9783030763848","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-76384-8_18","type":"book-chapter","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T23:50:53Z","timestamp":1621381853000},"page":"287-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Verifying Min-Plus Computations with Coq"],"prefix":"10.1007","author":[{"given":"Lucien","family":"Rakotomalala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Roux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Boyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"key":"18_CR1","unstructured":"RealTime-at-Work online Min-Plus interpreter for Network Calculus. https:\/\/www.realtimeatwork.com\/minplus-playground, Accessed 18 Nov 2020"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-71067-7_11","volume-title":"Theorem Proving in Higher Order Logics","author":"Y Bertot","year":"2008","unstructured":"Bertot, Y., Gonthier, G., Ould Biha, S., Pasca, I.: Canonical big operators. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 86\u2013101. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71067-7_11"},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11786-014-0181-1","volume":"9","author":"S Boldo","year":"2015","unstructured":"Boldo, S., Lelay, C., Melquiond, G.: Coquelicot: a user-friendly library of real analysis for coq. Math. Comput. Sci. 9(1), 41\u201362 (2015)","journal-title":"Math. Comput. Sci."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Bondorf, S., Schmitt, J.B.: The DiscoDNC v2 - a comprehensive tool for deterministic network calculus. In: Proceedings of the International Conference on Performance Evaluation Methodologies and Tools, ValueTools 2014, pp. 44\u201349 (2014)","DOI":"10.4108\/icst.valuetools.2014.258167"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bouillard, A., Boyer, M., Le Corronc, E.: Deterministic Network Calculus: From Theory to Practical Implementation (2018)","DOI":"10.1002\/9781119440284"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Bouillard, A., Cottenceau, B., Gaujal, B., Hardouin, L., Lagrange, S., Lhommeau, M., Thierry, E.: COINC library: a toolbox for the network calculus. In: Proceedings of the 4th International Conference on Performance Evaluation Methodologies and Tools, ValueTools, vol. 9 (2009)","DOI":"10.4108\/ICST.VALUETOOLS2009.8045"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"03","DOI":"10.1007\/s10626-007-0028-x","volume":"18","author":"A Bouillard","year":"2008","unstructured":"Bouillard, A., Thierry, E.: An algorithmic toolbox for network calculus. Disc. Event Dyn. Syst. Theory Appl. 18, 03 (2008)","journal-title":"Disc. Event Dyn. Syst. Theory Appl."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Boyer, M., Migge, J., Fumey, M.: PEGASE, a robust and efficient tool for worst case network traversal time. In: Proceedings of the SAE 2011 AeroTech Congress & Exhibition, Toulouse, France. SAE International (2011)","DOI":"10.4271\/2011-01-2711"},{"key":"18_CR9","unstructured":"Boyer, M., Navet, N., Fumey, M.: Experimental assessment of timing verification techniques for AFDX. In: 6th European Congress on Embedded Real Time Software and Systems, Toulouse, France (2012)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-16558-0_13","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"M Boyer","year":"2010","unstructured":"Boyer, M., Navet, N., Olive, X., Thierry, E.: The PEGASE project: precise and scalable temporal analysis for aerospace communication systems with network calculus. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6415, pp. 122\u2013136. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16558-0_13"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Cerqueira, F., Stutz, F., Brandenburg, B.B.: PROSA: a case for readable mechanized schedulability analysis. In: 2016 28th Euromicro Conference on Real-Time Systems (ECRTS), pp. 273\u2013284. IEEE (2016)","DOI":"10.1109\/ECRTS.2016.28"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-319-03545-1_10","volume-title":"Certified Programs and Proofs","author":"C Cohen","year":"2013","unstructured":"Cohen, C., D\u00e9n\u00e8s, M., M\u00f6rtberg, A.: Refinements for free!. In: Gonthier, G., Norrish, M. (eds.) CPP 2013. LNCS, vol. 8307, pp. 147\u2013162. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03545-1_10"},{"key":"18_CR13","unstructured":"The Coq development team. The Coq proof assistant reference manual, 2020. Version 8.12"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/11814771_36","volume-title":"Automated Reasoning","author":"B Gr\u00e9goire","year":"2006","unstructured":"Gr\u00e9goire, B., Th\u00e9ry, L.: A purely functional library for modular arithmetic and its application to certifying large prime numbers. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 423\u2013437. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814771_36"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Mabille, E., Boyer, M., Fejoz, L., Merz, S.: Towards certifying network calculus. In: Proceedings of the 4th Conference on Interactive Theorem Proving (ITP 2013), Rennes, France (2013)","DOI":"10.1007\/978-3-642-39634-2_37"},{"key":"18_CR16","unstructured":"Mahboubi, A., Tassi, E.: Mathematical Components (2018)"},{"key":"18_CR17","unstructured":"Rakotomalala, L., Boyer, M., Roux, P.: Verification, formal, of real-time networks. In: JRWRTC: Junior Workshop RTNS 2019, Toulouse, France, p. 2019 (2019)"},{"key":"18_CR18","unstructured":"Rouhling, D.: Formalisation Tools for Classical Analysis - A Case Study in Control Theory. (Outils pour la Formalisation en Analyse Classique - Une \u00c9tude de Cas en Th\u00e9orie du Contr\u00f4le). PhD thesis, University of C\u00f4te d\u2019Azur, Nice, France (2019)"},{"issue":"5","key":"18_CR19","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/90.803382","volume":"7","author":"H Sariowan","year":"1999","unstructured":"Sariowan, H., Cruz, R.L., Polyzos, G.C.: SCED: a generalized scheduling policy for guaranteeing quality-of-service. IEEE\/ACM Trans. Netw. 7(5), 669\u2013684 (1999)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Schmitt, J., Zdarsky, F.: The DISCO network calculator: a toolbox for worst case analysis, p. 8 (2006)","DOI":"10.1145\/1190095.1190105"},{"key":"18_CR21","unstructured":"Semeria, V.: Nombres r\u00e9els dans Coq. In: JFLA, pp. 104\u2013111 (2020)"},{"key":"18_CR22","unstructured":"Wandeler, E.: Modular performance analysis and interface based design for embedded real time systems (2006)"},{"key":"18_CR23","unstructured":"Wandeler, E., Thiele, L.: Real-Time Calculus (RTC) Toolbox (2006)"}],"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-030-76384-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T23:55:55Z","timestamp":1621382155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76384-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030763831","9783030763848"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76384-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 May 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2021\/","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":"66","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":"21","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":"32% - 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":"5","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)"}}]}}