T. Cormen, C. Leiserson, R. Rivest & C. Stein (2001):
Introduction to Algorithms,
2nd edition.
MIT Press.
R Dechter (2003):
Constraint Processing.
Morgan Kauffman.
S. Gulwani, S. Jha, A. Tiwari & R. Venkatesan (2011):
Synthesis of loop-free programs.
In: PLDI,
pp. 62–73,
doi:10.1145/2F1993498.1993506.
T. Ibaraki (1977):
The Power of Dominance Relations in Branch-and-Bound Algorithms.
J. ACM 24(2),
pp. 264–279,
doi:10.1145/2F322003.322010.
S. Itzhaky, S. Gulwani, N. Immerman & M. Sagiv (2010):
A simple inductive synthesis methodology and its applications.
In: OOPSLA,
pp. 36–46,
doi:10.1145/2F1869459.1869463.
C. Kreitz (1998):
Program Synthesis.
In: W. Bibel & P. Schmitt: Automated Deduction – A Basis for Applications, chapter III.2.5 III.
Kluwer,
pp. 105–134.
K. R. M. Leino (2010):
Dafny: an automatic program verifier for functional correctness.
In: Proc. 16th intl. conf. on Logic for Prog., AI, & Reasoning,
LPAR,
pp. 348–370,
doi:10.1007/2F978-3-642-17511-4_20.
S. Nedunuri (2012):
Theory and Techniques for Synthesizing Efficient Breadth-First Search Algorithms.
Univ. of Texas at Austin.
S. Nedunuri & W.R. Cook (2009):
Synthesis of Fast Programs for Maximum Segment Sum Problems.
In: Intl. Conf. on Generative Prog. and Component Engineering (GPCE),
doi:10.1145/2F1621607.1621626.
S. Nedunuri, D. R. Smith & W. R. Cook (2010):
A Class of Greedy Algorithms and Its Relation to Greedoids.
Intl. Colloq. on Theoretical Aspects of Computing (ICTAC),
doi:10.1007/2F978-3-642-14808-8_24.
S. Nedunuri, D. R. Smith & W. R. Cook (2012):
Theory and Techniques for a Class of Efficient Breadth-First Search Algorithms.
In: Intl. Symp. on Formal Methods (FM).
D. Pavlovic, P. Pepper & D. R. Smith (2010):
Formal Derivation of Concurrent Garbage Collectors..
In: Math. of Program Constr. (MPC),
doi:10.1007/2F978-3-642-13321-3_20.
Y. Pu, R. Bodík & S. Srivastava (2011):
Synthesis of first-order dynamic programming algorithms.
In: OOPSLA,
pp. 83–98,
doi:10.1145/2F2048066.2048076.
D. R. Smith (1988):
Structure and Design of Global Search Algorithms.
Tech. Rep. Kes.U.87.12.
Kestrel Institute.
D. R. Smith (1990):
KIDS: A Semi-Automatic Program Development System.
IEEE Trans. on Soft. Eng., Spec. Issue on Formal Methods 16(9),
pp. 1024–1043,
doi:10.1109/2F32.58788.
D. R. Smith (2010):
Global Search Theory Revisited.
Unpublished.
D. R. Smith, E. A. Parra & S. J. Westfold (1995):
Synthesis of high-performance transportation schedulers.
Technical Report.
Kestrel Institute.
D. R. Smith & S. Westfold (2008):
Synthesis of Propositional Satisfiability Solvers.
Final Proj. Report.
Kestrel Institute.
A. Solar-Lezama, L. Tancau, R. Bodik, S. Seshia & V. Saraswat (2006):
Combinatorial sketching for finite programs.
In: Proc. of the 12th intl. conf. on architectural support for prog. lang. and operating systems (ASPLOS),
pp. 404–415,
doi:10.1145/2F1168857.1168907.
S. Srivastava, S. Gulwani & J. S. Foster (2010):
From program verification to program synthesis.
In: POPL,
pp. 313–326,
doi:10.1.1.148.395.
M. Vechev & E. Yahav (2008):
Deriving linearizable fine-grained concurrent objects.
PLDI '08,
pp. 125–135,
doi:10.1145/2F1375581.1375598.
eptcs@eptcs.org