{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:57:14Z","timestamp":1709254634062},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"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":["Form Methods Syst Des"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10703-021-00382-4","type":"journal-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T21:08:49Z","timestamp":1634764129000},"page":"119-120","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Preface of the special issue on the conference on formal methods in computer aided design 2018"],"prefix":"10.1007","volume":"57","author":[{"given":"Nikolaj","family":"Bj\u00f8rner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie","family":"Gurfinkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"key":"382_CR1","doi-asserted-by":"crossref","unstructured":"Backeman P, R\u00fcmmer P, Zeljic A (2018) Bit-vector interpolation and quantifier elimination by lazy reduction. In: Bj\u00f8rner N, Gurfinkel A (eds) 2018 Formal methods in computer aided design, FMCAD 2018, Austin, TX, USA, October 30\u2013November 2, 2018. IEEE","DOI":"10.23919\/FMCAD.2018.8603023"},{"key":"382_CR2","doi-asserted-by":"crossref","unstructured":"Bloem R, Braud-Santoni N, Hadzic V, Egly U, Lonsing F, Seidl M (2018) Expansion-based QBF solving without recursion. In: Bj\u00f8rner N, Gurfinkel A (eds)2018 Formal methods in computer aided design, FMCAD 2018, Austin, TX, USA, October 30\u2013November 2, 2018. IEEE","DOI":"10.23919\/FMCAD.2018.8603004"},{"key":"382_CR3","doi-asserted-by":"crossref","unstructured":"Griggio A, Roveri M, Tonetta S (2018) Certifying proofs for LTL model checking. In: Bj\u00f8rner N, Gurfinkel A (eds) 2018 Formal methods in computer aided design, FMCAD 2018, Austin, TX, USA, October 30\u2013November 2, 2018. IEEE","DOI":"10.23919\/FMCAD.2018.8603022"},{"key":"382_CR4","doi-asserted-by":"crossref","unstructured":"Luteberget B, Claessen K, Johansen C (2018) Design-time railway capacity verification using SAT modulo discrete event simulation. In: Bj\u00f8rner N, Gurfinkel A (eds) 2018 Formal methods in computer aided design, FMCAD 2018, Austin, TX, USA, October 30\u2013November 2, 2018. IEEE","DOI":"10.23919\/FMCAD.2018.8603003"},{"key":"382_CR5","doi-asserted-by":"crossref","unstructured":"Padon O, Hoenicke J, McMillan KL, Podelski A, Sagiv M, Shoham S (2018) Temporal prophecy for proving temporal properties of infinite-state systems. In: Bj\u00f8rner N, Gurfinkel A (eds) 2018 Formal methods in computer aided design, FMCAD 2018, Austin, TX, USA, October 30\u2013November 2, 2018. IEEE","DOI":"10.23919\/FMCAD.2018.8603008"},{"key":"382_CR6","doi-asserted-by":"crossref","unstructured":"Pani T, Weissenbacher G, Zuleger F (2018) Rely-guarantee reasoning for automated bound analysis of lock-free algorithms. In: Bj\u00f8rner N, Gurfinkel A (eds) 2018 Formal methods in computer aided design, FMCAD 2018, Austin, TX, USA, October 30\u2013November 2, 2018. IEEE","DOI":"10.23919\/FMCAD.2018.8603020"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-021-00382-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10703-021-00382-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-021-00382-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T18:13:30Z","timestamp":1636481610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10703-021-00382-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["382"],"URL":"https:\/\/doi.org\/10.1007\/s10703-021-00382-4","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8]]},"assertion":[{"value":"30 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}