{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:17Z","timestamp":1772164037789,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T00:00:00Z","timestamp":1421193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["12-2-0293"],"award-info":[{"award-number":["12-2-0293"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1253229"],"award-info":[{"award-number":["CCF-1253229"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,14]]},"DOI":"10.1145\/2676726.2677006","type":"proceedings-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T08:51:05Z","timestamp":1418979065000},"page":"689-700","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":60,"title":["Fiat"],"prefix":"10.1145","author":[{"given":"Benjamin","family":"Delaware","sequence":"first","affiliation":[{"name":"MIT CSAIL, Cambridge, USA"}]},{"given":"Cl\u00e9ment","family":"Pit-Claudel","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]},{"given":"Jason","family":"Gross","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]},{"given":"Adam","family":"Chlipala","sequence":"additional","affiliation":[{"name":"MIT CSAIL, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,1,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/256428.167078"},{"key":"e_1_3_2_2_2_1","first-page":"165","volume-title":"Constructing Programs from Specifications","author":"Blaine Lee","year":"1991","unstructured":"Lee Blaine and Allen Goldberg . DTRE -- a semi-automatic transformation system . In Constructing Programs from Specifications , pages 165 -- 204 . Elsevier , 1991 . Lee Blaine and Allen Goldberg. DTRE -- a semi-automatic transformation system. In Constructing Programs from Specifications, pages 165--204. Elsevier, 1991."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/181550.181564"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535859"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03545-1_10"},{"key":"e_1_3_2_2_6_1","unstructured":"http:\/\/coq.inria.fr\/distrib\/current\/refman\/Reference-Manual029.html.  http:\/\/coq.inria.fr\/distrib\/current\/refman\/Reference-Manual029.html."},{"key":"e_1_3_2_2_7_1","volume-title":"August","author":"Dijkstra Edsger W.","year":"1967","unstructured":"Edsger W. Dijkstra . A constructive approach to the problem of program correctness. Circulated privately , August 1967 . Edsger W. Dijkstra. A constructive approach to the problem of program correctness. Circulated privately, August 1967."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993504"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"J.\n      He C.A.R.\n      Hoare and \n      J.W.\n      Sanders\n  . \n  Data refinement refined\n  . In Bernard Robinet and Reinhard Wilhelm editors ESOP 86 volume \n  213\n   of \n  Lecture Notes in Computer Science pages \n  187\n  --\n  196\n  . \n  Springer Berlin Heidelberg 1986\n  .   J. He C.A.R. Hoare and J.W. Sanders. Data refinement refined. In Bernard Robinet and Reinhard Wilhelm editors ESOP 86 volume 213 of Lecture Notes in Computer Science pages 187--196. Springer Berlin Heidelberg 1986.","DOI":"10.1007\/3-540-16442-1_14"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289507"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800233.807045"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(87)80066-4"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357177"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886619.1886641"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025153"},{"key":"e_1_3_2_2_16_1","first-page":"302","volume-title":"IEEE Multimedia Systems'99","author":"Smith Douglas R.","year":"1990","unstructured":"Douglas R. Smith . KIDS : A semi-automatic program development system. In Client Resources on the Internet , IEEE Multimedia Systems'99 , pages 302 -- 307 , 1990 . Douglas R. Smith. KIDS: A semi-automatic program development system. In Client Resources on the Internet, IEEE Multimedia Systems'99, pages 302--307, 1990."},{"key":"e_1_3_2_2_17_1","volume-title":"Synthesis of propositional satisfiability solvers","author":"Smith Douglas R.","year":"2008","unstructured":"Douglas R. Smith and Stephen J. Westfold . Synthesis of propositional satisfiability solvers , 2008 . Douglas R. Smith and Stephen J. Westfold. Synthesis of propositional satisfiability solvers, 2008."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375599"},{"key":"e_1_3_2_2_20_1","unstructured":"http:\/\/www.kestrel.edu\/home\/prototypes\/specware.html.  http:\/\/www.kestrel.edu\/home\/prototypes\/specware.html."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91592"}],"event":{"name":"POPL '15: The 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Mumbai India","acronym":"POPL '15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676726.2677006","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2676726.2677006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:03Z","timestamp":1750212783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676726.2677006"}},"subtitle":["Deductive Synthesis of Abstract Data Types in a Proof Assistant"],"short-title":[],"issued":{"date-parts":[[2015,1,14]]},"references-count":20,"alternative-id":["10.1145\/2676726.2677006","10.1145\/2676726"],"URL":"https:\/\/doi.org\/10.1145\/2676726.2677006","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2775051.2677006","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,1,14]]},"assertion":[{"value":"2015-01-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}