{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T07:03:10Z","timestamp":1779087790399,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030908690","type":"print"},{"value":"9783030908706","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-90870-6_38","type":"book-chapter","created":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:06:44Z","timestamp":1636502804000},"page":"697-716","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Formal Verification of Complex Data Paths: An Industrial Experience"],"prefix":"10.1007","author":[{"given":"Carl-Johan H.","family":"Seger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,10]]},"reference":[{"key":"38_CR1","unstructured":"Intel corporation annual report (1994). https:\/\/www.intel.com\/content\/www\/us\/en\/history\/history-1994-annual-report.html"},{"key":"38_CR2","unstructured":"2017 - IEEE standard for SystemVerilog - unified hardware design, specification, and verification language (2017). https:\/\/standards.ieee.org\/standard\/1800-2017.html"},{"key":"38_CR3","unstructured":"IEEE standard for floating-point arithmetic. IEEE Std 754\u20132019 (Revision of IEEE 754\u20132008), pp. 1\u201384 (2019)"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-48256-3_22","volume-title":"Theorem Proving in Higher Order Logics","author":"MD Aagaard","year":"1999","unstructured":"Aagaard, M.D., Jones, R.B., Seger, C.J.H.: Lifted-FL: a pragmatic implementation of combined model checking and theorem proving. In: Bertot, Y., Dowek, G., Th\u00e9ry, L., Hirschowitz, A., Paulin, C. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 323\u2013340. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48256-3_22"},{"issue":"8","key":"38_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"100","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 100(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"38_CR6","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R.: Handbook of model checking, vol. 10. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8","DOI":"10.1007\/978-3-319-10575-8"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Gordon, M.J., Milner, A.J.: Edinburgh LCF. A mechanised logic of computation (1979)","DOI":"10.1007\/3-540-09724-4"},{"issue":"4","key":"38_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1109\/43.372367","volume":"14","author":"S Hazelhurst","year":"1995","unstructured":"Hazelhurst, S., Seger, C.-J.: A simple theorem prover based on symbolic trajectory evaluation and BDD\u2019s. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 14(4), 413\u2013422 (1995)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"key":"38_CR9","unstructured":"Johnson, S.C.: Lint, a C program checker. Bell Telephone Laboratories Murray Hill (1977)"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Joyce, J.J., Seger, V.: Linking BDD-based symbolic evaluation to interactive theorem-proving. In: 30th ACM\/IEEE Design Automation Conference, pp. 469\u2013474. IEEE (1993)","DOI":"10.1145\/157485.164981"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-02658-4_32","volume-title":"Computer Aided Verification","author":"R Kaivola","year":"2009","unstructured":"Kaivola, R., et al.: Replacing testing with formal verification in Intel CoreTM i7 processor execution engine validation. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 414\u2013429. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_32"},{"key":"38_CR12","unstructured":"KiranKumar, V.A., Gupta, A., Ghughal, R.: Symbolic trajectory evaluation: the primary validation vehicle for next generation Intel processor graphics FPU. In: 2012 Formal Methods in Computer-Aided Design (FMCAD), pp. 149\u2013156. IEEE (2012)"},{"issue":"2","key":"38_CR13","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10009-004-0183-4","volume":"7","author":"MR Prasad","year":"2005","unstructured":"Prasad, M.R., Biere, A., Gupta, A.: A survey of recent advances in sat-based formal verification. Int. J. Softw. Tools Technol. Transfer 7(2), 156\u2013173 (2005)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"38_CR14","unstructured":"Seger, C.-J.: The VossII hardware verification suite (2020). https:\/\/github.com\/TeamVoss\/VossII"},{"issue":"2","key":"38_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01383966","volume":"6","author":"C-JH Seger","year":"1995","unstructured":"Seger, C.-J.H., Bryant, R.E.: Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods Syst. Des. 6(2), 147\u2013189 (1995)","journal-title":"Formal Methods Syst. Des."},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Seger, C.J.H., et al.: An industrially effective environment for formal hardware verification. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 24(9), 1381\u20131405 (2005)","DOI":"10.1109\/TCAD.2005.850814"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Turner, D.A.: A new implementation technique for applicative languages. Softw. Pract. Exper. 9(1), 31\u201349 (1979)","DOI":"10.1002\/spe.4380090105"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-58179-0_62","volume-title":"Computer Aided Verification","author":"Z Zhu","year":"1994","unstructured":"Zhu, Z., Seger, C.-J.: The completeness of a hardware inference system. In: Dill, David L. (ed.) CAV 1994. LNCS, vol. 818, pp. 286\u2013298. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58179-0_62"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90870-6_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T00:12:39Z","timestamp":1636503159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90870-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030908690","9783030908706"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90870-6_38","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":"10 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","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":"20 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2021.csp.escience.cn\/dct\/page\/1","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":"131","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":"40","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":"2","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":"31% - 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":"9","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)"}},{"value":"Additionally, this includes 4 invited full papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}