Synthesis of first-order dynamic programming algorithms

To solve a problem with a dynamic programming algorithm, one must reformulate the problem such that its solution can be formed from solutions to overlapping subproblems. Because overlapping subprob...

[1]  Ilya Shlyakhter.  Generating effective symmetry-breaking predicates for search problems , 2007, Discret. Appl. Math..

[2]  Neil Immerman,et al.  A simple inductive synthesis methodology and its applications , 2010, OOPSLA.

[3]  William R. Cook,et al.  Synthesis of fast programs for maximum segment sum problems , 2009, GPCE '09.

[4]  Sumit Gulwani,et al.  From program verification to program synthesis , 2010, POPL '10.

[5]  Sanjit A. Seshia,et al.  Combinatorial sketching for finite programs , 2006, ASPLOS XII.

[6]  Sanjit A. Seshia,et al.  Sketching stencils , 2007, PLDI '07.

[7]  Robert Paige,et al.  Symbolic Finite Differencing - Part I , 1990, ESOP.

[8]  Armando Solar-Lezama,et al.  Sketching concurrent data structures , 2008, PLDI '08.

[9]  Sumit Gulwani,et al.  Program analysis as constraint solving , 2008, PLDI '08.

[10]  Mizuhito Ogawa,et al.  Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems , 2000, ICFP '00.

[11]  William R. Cook,et al.  A Class of Greedy Algorithms and Its Relation to Greedoids , 2010, ICTAC.

[12]  Sumit Gulwani,et al.  VS3: SMT Solvers for Program Verification , 2009, CAV.

[13]  F. Frances Yao,et al.  Efficient dynamic programming using quadrangle inequalities , 1980, STOC '80.

[14]  Sumit Gulwani,et al.  Program verification using templates over predicate abstraction , 2009, PLDI '09.

[15]  Rastislav Bodík,et al.  Programming with angelic nondeterminism , 2010, POPL '10.

[16]  R. Bellman.  The theory of dynamic programming , 1954 .

[17]  Sumit Gulwani,et al.  Constraint-Based Invariant Inference over Predicate Abstraction , 2008, VMCAI.

[18]  Pedro M. Domingos,et al.  Programming by Demonstration Using Version Space Algebra , 2003, Machine Learning.