{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:48:10Z","timestamp":1743104890351,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030862046"},{"type":"electronic","value":"9783030862053"}],"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-86205-3_8","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T08:02:57Z","timestamp":1630396977000},"page":"139-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving Automation for Higher-Order Proof Steps"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Defourn\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, K., Reynolds, A., Barrett, C.W., Tinelli, C.: A new decision procedure for finite sets and cardinality constraints in SMT. In: Proceedings of the Automated Reasoning - 8th International Joint Conference (IJCAR 2016), Coimbra, Portugal, June 27\u2013July 2, 2016, pp. 82\u201398 (2016)","DOI":"10.1007\/978-3-319-40229-1_7"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Barbosa, H., Reynolds, A., Ouraoui, D.E., Tinelli, C., Barrett, C.W.: Extending SMT solvers to higher-order logic. In: Proceedings of the Automated Deduction - CADE 27\u201327th International Conference on Automated Deduction, Natal, Brazil, 27\u201330 August 2019, pp. 35\u201354 (2019)","DOI":"10.1007\/978-3-030-29436-6_3"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bentkamp, A., Blanchette, J., Tourret, S., Vukmirovic, P., Waldmann, U.: Superposition with lambdas. In: Proceedings of the Automated Deduction - CADE 27\u201327th International Conference on Automated Deduction, Natal, Brazil, August 27\u201330, 2019, pp. 55\u201373 (2019)","DOI":"10.1007\/978-3-030-29436-6_4"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bhayat, A., Reger, G.: A combinator-based superposition calculus for higher-order logic. In: Proceedings of the Automated Reasoning - 10th International Joint Conference, IJCAR 2020, Paris, France, July 1\u20134, 2020, Part I, pp. 278\u2013296 (2020)","DOI":"10.1007\/978-3-030-51074-9_16"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Brown, C.E.: Satallax: an automatic higher-order prover. In: Proceedings of the Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26\u201329, 2012, pp. 111\u2013117 (2012)","DOI":"10.1007\/978-3-642-31365-3_11"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cousineau, D., Doligez, D., Lamport, L., Merz, S., Ricketts, D., Vanzetto, H.: TLA+ Proofs. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) 18th International Symposium On Formal Methods - FM 2012. Lecture Notes in Computer Science, vol. 7436, pp. 147\u2013154. Springer, Paris, France, August 2012. http:\/\/www.springerlink.com","DOI":"10.1007\/978-3-642-32759-9_14"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kov\u00e1cs, L., Kragl, B., Voronkov, A.: Extensional crisis and proving identity. In: Proceedings of the Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3\u20137, 2014, pp. 185\u2013200 (2014)","DOI":"10.1007\/978-3-319-11936-6_14"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Kotelnikov, E., Kov\u00e1cs, L., Voronkov, A.: A first class boolean sort in first-order theorem proving and TPTP. In: Proceedings of the Intelligent Computer Mathematics - International Conference (CICM 2015), Washington, DC, USA, July 13\u201317, 2015, pp. 71\u201386 (2015)","DOI":"10.1007\/978-3-319-20615-8_5"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Lamport, L.: How to write a proof. Am. Math. Monthly 102, 600\u2013608 (1995)","DOI":"10.1080\/00029890.1995.12004627"},{"key":"8_CR10","volume-title":"Specifying Systems","author":"L Lamport","year":"2002","unstructured":"Lamport, L.: Specifying Systems. Addison-Wesley, The TLA+ Language and Tools for Hardware and Software Engineers (2002)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Mentr\u00e9, D., March\u00e9, C., Filli\u00e2tre, J., Asuka, M.: Discharging proof obligations from atelier B using multiple automated provers. In: Proceedings of the Abstract State Machines, Alloy, B, VDM, and Z - Third International Conference, ABZ 2012, Pisa, Italy, June 18\u201321, 2012, pp. 238\u2013251 (2012)","DOI":"10.1007\/978-3-642-30885-7_17"},{"key":"8_CR12","unstructured":"Reger, G., Suda, M.: Set of support for theory reasoning. In: IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, 7\u201312 May 2017 (2017)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Steen, A., Benzm\u00fcller, C.: The higher-order prover leo-iii. In: Proceedings of the Automated Reasoning - 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference (FloC 2018), Oxford, UK, July 14\u201317, 2018, pp. 108\u2013116 (2018)","DOI":"10.1007\/978-3-319-94205-6_8"},{"key":"8_CR14","unstructured":"Sutcliffe, G. (ed.): Proceedings of the 10th IJCAR ATP System Competition (CASC-J10), July 2020"},{"key":"8_CR15","unstructured":"Vanzetto, H.: Proof automation and type synthesis for set theory in the context of TLA+. (Automatisation de preuves et synth\u00e8se de types pour la th\u00e9orie des ensembles dans le contexte de TLA+). Ph.D. thesis, University of Lorraine, Nancy, France (2014), https:\/\/tel.archives-ouvertes.fr\/tel-01096518"},{"key":"8_CR16","unstructured":"Vukmirovic, P., Bentkamp, A., Nummelin, V.: Efficient full higher-order unification. In: 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), June 29-July 6, 2020, Paris, France (Virtual Conference). pp. 5:1\u20135:17 (2020)"},{"key":"8_CR17","unstructured":"Vukmirovic, P., Nummelin, V.: Boolean reasoning in a higher-order superposition prover. In: Joint Proceedings of the 7th Workshop on Practical Aspects of Automated Reasoning (PAAR) and the 5th Satisfiability Checking and Symbolic Computation Workshop (SC-Square) Workshop, 2020 Co-located with the 10th International Joint Conference on Automated Reasoning (IJCAR 2020), Paris, France, June-July, 2020 (Virtual). pp. 148\u2013166 (2020)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86205-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T23:06:42Z","timestamp":1630537602000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86205-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030862046","9783030862053"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86205-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Birmingham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 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":"frocos2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/frocos2021.github.io\/","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":"23","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":"16","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":"0","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":"70% - 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":"2.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)"}}]}}