{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:50Z","timestamp":1772164010046,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,10,4]],"date-time":"2009-10-04T00:00:00Z","timestamp":1254614400000},"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":[[2009,10,4]]},"DOI":"10.1145\/1621607.1621626","type":"proceedings-article","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T14:23:22Z","timestamp":1254839002000},"page":"117-126","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Synthesis of fast programs for maximum segment sum problems"],"prefix":"10.1145","author":[{"given":"Srinivas","family":"Nedunuri","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William R.","family":"Cook","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/32.2.122"},{"key":"e_1_3_2_1_2_1","volume-title":"Algebra of programming","author":"Bird R. S.","year":"1997","unstructured":"R. S. Bird and O. De Moor . Algebra of programming . Prentice-Hall, Inc. , NJ , USA, 1997 . R. S. Bird and O. De Moor. Algebra of programming. Prentice-Hall, Inc., NJ, USA, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800210112"},{"key":"e_1_3_2_1_4_1","volume-title":"Constraint Processing. Morgan Kauffman","author":"Dechter R","year":"2003","unstructured":"R Dechter . Constraint Processing. Morgan Kauffman , 2003 . R Dechter. Constraint Processing. Morgan Kauffman, 2003."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322010"},{"key":"e_1_3_2_1_6_1","volume-title":"Theories for algorithm calculation. Technical report","author":"Jeuring D. J. T.","year":"1993","unstructured":"D. J. T. Jeuring and T. O. Pekela . Theories for algorithm calculation. Technical report , 1993 . D. J. T. Jeuring and T. O. Pekela. Theories for algorithm calculation. Technical report, 1993."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328408.1328414"},{"key":"e_1_3_2_1_8_1","volume-title":"To: Intl. Conf. on Formal Engg Methods (ICFEM)","author":"Nedunuri S.","year":"2009","unstructured":"S. Nedunuri , W. R. Cook , and D. R. Smith . Synthesis of greedy algorithms from dominance relations . Submitted To: Intl. Conf. on Formal Engg Methods (ICFEM) , 2009 . S. Nedunuri, W. R. Cook, and D. R. Smith. Synthesis of greedy algorithms from dominance relations. Submitted To: Intl. Conf. on Formal Engg Methods (ICFEM), 2009."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. NASA Symposium on Formal Methods","author":"Nedunuri S.","year":"2009","unstructured":"S. Nedunuri , D. R. Smith , and W. R. Cook . Tactical synthesis of efficient global search algorithms . In Proc. NASA Symposium on Formal Methods , April 2009 . S. Nedunuri, D. R. Smith, and W. R. Cook. Tactical synthesis of efficient global search algorithms. In Proc. NASA Symposium on Formal Methods, April 2009."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357177"},{"key":"e_1_3_2_1_11_1","unstructured":"Specware. http:\/\/www.specware.org.  Specware. http:\/\/www.specware.org."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351254"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792034.1792041"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(87)90034-7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.58788"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11560647_37"},{"key":"e_1_3_2_1_18_1","volume-title":"Synthesis of high-performance transportation schedulers. Technical report","author":"Smith D. R.","year":"1995","unstructured":"D. R. Smith , E. A. Parra , and S. J. Westfold . Synthesis of high-performance transportation schedulers. Technical report , Kestrel Institute , 1995 . D. R. Smith, E. A. Parra, and S. J. Westfold. Synthesis of high-performance transportation schedulers. Technical report, Kestrel Institute, 1995."}],"event":{"name":"GPCE'09: Generative Programming and Component Engineering","location":"Denver Colorado USA","acronym":"GPCE'09","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the eighth international conference on Generative programming and component engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1621607.1621626","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1621607.1621626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:17:46Z","timestamp":1750234666000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1621607.1621626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,4]]},"references-count":17,"alternative-id":["10.1145\/1621607.1621626","10.1145\/1621607"],"URL":"https:\/\/doi.org\/10.1145\/1621607.1621626","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1837852.1621626","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009,10,4]]},"assertion":[{"value":"2009-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}