{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:41Z","timestamp":1772164061179,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T00:00:00Z","timestamp":1504742400000},"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":[[2017,9,7]]},"DOI":"10.1145\/3122955.3122961","type":"proceedings-article","created":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T08:27:52Z","timestamp":1504254472000},"page":"40-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Speculate: discovering conditional equations and inequalities about black-box functions by reasoning from test results"],"prefix":"10.1145","author":[{"given":"Rudy","family":"Braquehais","sequence":"first","affiliation":[{"name":"University of York, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"Runciman","sequence":"additional","affiliation":[{"name":"University of York, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,9,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2017. Haskell\u2019s Data.Dynamic library documentation. https:\/\/hackage.haskell. org\/package\/base\/docs\/Data-Dynamic.html . (2017).  2017. Haskell\u2019s Data.Dynamic library documentation. https:\/\/hackage.haskell. org\/package\/base\/docs\/Data-Dynamic.html . (2017)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Franz Baader and Tobias Nipkow. 1999. Term Rewriting and All That. Cambridge University Press.   Franz Baader and Tobias Nipkow. 1999. Term Rewriting and All That. Cambridge University Press.","DOI":"10.1017\/CBO9781139172752"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Leo Bachmair Nachum Dershowitz and David A. Plaisted. 1989. Completion Without Failure. In Resolution Of Equations In Algebraic Structures. Vol. 2. Academic Press Boston 1\u201330.  Leo Bachmair Nachum Dershowitz and David A. Plaisted. 1989. Completion Without Failure. In Resolution Of Equations In Algebraic Structures. Vol. 2. Academic Press Boston 1\u201330.","DOI":"10.1016\/B978-0-12-046371-8.50007-9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976002.2976003"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28717-6_14"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351266"},{"key":"e_1_3_2_1_7_1","volume-title":"Workshop on Automated Theory eXploration: ATX","author":"Claessen Koen","year":"2012"},{"key":"e_1_3_2_1_8_1","volume-title":"TAP","author":"Claessen Koen","year":"2010"},{"key":"e_1_3_2_1_9_1","unstructured":"John Horton Conway. 1971. Regular algebra and finite machines. Chapman and Hall.  John Horton Conway. 1971. Regular algebra and finite machines. Chapman and Hall."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2430532.2364515"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.01.015"},{"key":"e_1_3_2_1_12_1","volume-title":"Hipster: Integrating Theory Exploration in a Proof Assistant","author":"Johansson Moa","year":"2014"},{"key":"e_1_3_2_1_13_1","volume-title":"Automation of Reasoning","author":"Knuth Donald"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1037"},{"key":"e_1_3_2_1_15_1","unstructured":"Fredrik Lindblad. 2007. Property Directed Generation of First-Order Test Data. In TFP\u201907. 105\u2013123.  Fredrik Lindblad. 2007. Property Directed Generation of First-Order Test Data. In TFP\u201907. 105\u2013123."},{"key":"e_1_3_2_1_16_1","volume-title":"IFL\u201913","author":"Reich Jason S."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411286.1411292"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/321312.321326"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/581690.581691"},{"key":"e_1_3_2_1_20_1","unstructured":"Nicholas Smallbone. 2011. Property-based testing for functional programs. Licentiate Thesis. Chalmers University of Technology.  Nicholas Smallbone. 2011. Property-based testing for functional programs. Licentiate Thesis. Chalmers University of Technology."},{"key":"e_1_3_2_1_21_1","unstructured":"Nicholas Smallbone. 2013. Lightweight verification of functional programs. Ph.D. Dissertation. Chalmers University of Technology.  Nicholas Smallbone. 2013. Lightweight verification of functional programs. Ph.D. Dissertation. Chalmers University of Technology."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Nicholas Smallbone and Moa Johansson. 2017. Quick specifications for the busy programmer. (2017). http:\/\/www.cse.chalmers.se\/~nicsma\/papers\/quickspec2.pdf Accepted for publication in JFP Cambridge University Press.  Nicholas Smallbone and Moa Johansson. 2017. Quick specifications for the busy programmer. (2017). http:\/\/www.cse.chalmers.se\/~nicsma\/papers\/quickspec2.pdf Accepted for publication in JFP Cambridge University Press.","DOI":"10.1017\/S0956796817000090"},{"key":"e_1_3_2_1_23_1","unstructured":"The GHC Team. 1992\u20132017. The Glasgow Haskell Compiler. https:\/\/www.haskell. org\/ghc\/ . (1992\u20132017).  The GHC Team. 1992\u20132017. The Glasgow Haskell Compiler. https:\/\/www.haskell. org\/ghc\/ . (1992\u20132017)."},{"key":"e_1_3_2_1_24_1","unstructured":"Michael Walker and Colin Runciman. 2017. Cheap Remarks about Concurrent Programs. (2017). Accepted for presentation at TFP\u201917.  Michael Walker and Colin Runciman. 2017. Cheap Remarks about Concurrent Programs. (2017). Accepted for presentation at TFP\u201917."}],"event":{"name":"ICFP '17: ACM SIGPLAN International Conference on Functional Programming","location":"Oxford UK","acronym":"ICFP '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3122955.3122961","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3122955.3122961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:11:04Z","timestamp":1750198264000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3122955.3122961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,7]]},"references-count":24,"alternative-id":["10.1145\/3122955.3122961","10.1145\/3122955"],"URL":"https:\/\/doi.org\/10.1145\/3122955.3122961","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3156695.3122961","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,9,7]]},"assertion":[{"value":"2017-09-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}