{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:25Z","timestamp":1750221205621,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,9,3]]},"DOI":"10.1145\/3236950.3236960","type":"proceedings-article","created":{"date-parts":[[2018,8,14]],"date-time":"2018-08-14T12:09:54Z","timestamp":1534248594000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["System Description"],"prefix":"10.1145","author":[{"given":"Sylvia","family":"Grewe","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Erdweg","sequence":"additional","affiliation":[{"name":"Delft University of Technology, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Pacak","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mira","family":"Mezini","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Darmstadt, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2014. Isabelle documentation. http:\/\/isabelle.in.tum.de\/documentation.html.  2014. Isabelle documentation. http:\/\/isabelle.in.tum.de\/documentation.html."},{"volume-title":"Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","author":"Moura Leonardo De","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765236.1765246"},{"key":"e_1_3_2_1_6_1","unstructured":"Cop development team. 2014. The Coq proof assistant reference manual.  Cop development team. 2014. The Coq proof assistant reference manual."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967973.2968606"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45221-5_23"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/242224.242477"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1939141.1939161"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-015-9360-2"},{"volume-title":"A Proof Assistant for Higher-order Logic","author":"Nipkow Tobias","key":"e_1_3_2_1_14_1"},{"edition":"2","volume-title":"Programming in Scala: A Comprehensive Step-by-Step Guide, 2Nd Edition","author":"Odersky Martin","key":"e_1_3_2_1_15_1"},{"volume-title":"Types and programming languages","author":"Pierce Benjamin C.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"Proof planning methods as schemas","volume":"11","author":"Richardson Julian","year":"1999","journal-title":"J. Symbolic Computation"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89439-1_20"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45221-5_49"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1939141.1939142"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-017-9407-7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500579"}],"event":{"name":"PPDP '18: The 20th International Symposium on Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Goethe University Goethe University Frankfurt"],"location":"Frankfurt am Main Germany","acronym":"PPDP '18"},"container-title":["Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236950.3236960","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3236950.3236960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:34Z","timestamp":1750210774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3236950.3236960"}},"subtitle":["An Infrastructure for Combining Domain Knowledge with Automated Theorem Provers"],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":20,"alternative-id":["10.1145\/3236950.3236960","10.1145\/3236950"],"URL":"https:\/\/doi.org\/10.1145\/3236950.3236960","relation":{},"subject":[],"published":{"date-parts":[[2018,9,3]]},"assertion":[{"value":"2018-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}