Information Technology Reference
In-Depth Information
60. Singh, R., Gulwani, S.: Synthesizing number transformations from input-output
examples. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358,
pp. 634-651. Springer, Heidelberg (2012)
61. Smith, D.R.: Generating programs plus proofs by refinement. In: Meyer, B., Wood-
cock, J. (eds.) VSTTE 2005. LNCS, vol. 4171, pp. 182-188. Springer, Heidelberg
(2008)
62. Solar-Lezama, A., Arnold, G., Tancau, L., Bodık, R., Saraswat, V.A., Seshia, S.A.:
Sketching stencils. In: PLDI, pp. 167-178 (2007)
63. Solar-Lezama, A., Jones, C.G., Bodık, R.: Sketching concurrent data structures.
In: PLDI (2008)
64. Solar-Lezama, A., Tancau, L., Bodık, R., Seshia, S.A., Saraswat, V.A.: Combina-
torial sketching for finite programs. In: ASPLOS (2006)
65. Srivastava, S., Gulwani, S., Foster, J.: From program verification to program syn-
thesis. In: POPL (2010)
66. Summers, P.D.: A methodology for LISP program construction from examples.
JACM 24(1), 161-175 (1977)
67. Suter, P.: Programming with Specifications. PhD thesis, EPFL (December 2012)
68. Suter, P., Dotta, M., Kuncak, V.: Decision procedures for algebraic data types with
abstractions. In: ACM POPL (2010)
69. Suter, P., Koksal, A.S., Kuncak, V.: Satisfiability modulo recursive programs. In: Ya-
hav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 298-315. Springer, Heidelberg (2011)
70. Torlak, E., Jackson, D.: Kodkod: A relational model finder. In: Grumberg, O., Huth,
M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 632-647. Springer, Heidelberg (2007)
71. Udupa, A., Raghavan, A., Deshmukh, J., Mador-Haim, S., Martin, M., Alur, R.:
Transit: Specifying protocols with concolic snippets. In: ACM Conference on Pro-
gramming Language Design and Implementation (2013)
72. Van Roy, P.: Logic programming in Oz with Mozart. In: ICLP (1999)
73. Vechev, M., Yahav, E., Yorsh, G.: Inferring synchronization under limited observ-
ability. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505,
pp. 139-154. Springer, Heidelberg (2009)
74. Wei, Y., Furia, C.A., Kazmin, N., Meyer, B.: Inferring better contracts. In: ICSE
(2011)
75. Wei, Y., Pei, Y., Furia, C.A., Silva, L.S., Buchholz, S., Meyer, B., Zeller, A.: Auto-
mated fixing of programs with contracts. In: Proceedings of the 19th International
Symposium on Software Testing and Analysis, ISSTA 2010, pp. 61-72 (2010)
76. Wirth, N.: Program development by stepwise refinement. Commun. ACM 26(1),
70-74 (1983) (reprint)
77. Nokhbeh Zaeem, R., Khurshid, S.: Contract-based data structure repair using al-
loy. In: D'Hondt, T. (ed.) ECOOP 2010. LNCS, vol. 6183, pp. 577-598. Springer,
Heidelberg (2010)
78. Zaeem, R.N., Malik, M.Z., Khurshid, S.: Repair abstractions for more ecient data
structure repair. In: Int. Conf. Runtime Verification (2013)
79. Zee, K., Kuncak, V., Taylor, M., Rinard, M.: Runtime checking for program verifi-
cation. In: Sokolsky, O., Tasıran, S. (eds.) RV 2007. LNCS, vol. 4839, pp. 202-213.
Springer, Heidelberg (2007)
