Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations

Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations

We introduce a framework allowing domain experts to manipulate computational terms in the interest of deriving better, more efficient implementations.It employs deductive reasoning to generate provably correct efficient implementations from a very high-level specification of an algorithm, and induct...

Full description

Bibliographic Details
Main Authors: Chowdhury, Rezaul, Itzhaky, Shachar, Singh, Rohit, Solar Lezama, Armando, Yessenov, Kuat T, Lu, Yongquan, Leiserson, Charles E
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Association for Computing Machinery (ACM) 2017
Online Access:http://hdl.handle.net/1721.1/112349
https://orcid.org/0000-0002-3306-5084
https://orcid.org/0000-0002-8927-3018
https://orcid.org/0000-0001-7604-8252
https://orcid.org/0000-0001-5959-5254

Internet

http://hdl.handle.net/1721.1/112349
https://orcid.org/0000-0002-3306-5084
https://orcid.org/0000-0002-8927-3018
https://orcid.org/0000-0001-7604-8252
https://orcid.org/0000-0001-5959-5254

Similar Items