Liberating the programmer with prorogued programming

SPLASH 2012: Onward! 2012 - Proceedings of the ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software

Volumn , Issue , 2012, Pages 11-26

  Afshari, Mehrdad ^a   Barr, Earl T ^a   Su, Zhendong ^a  

^a University of California Davis   (United States)

Author keywords

Executable refinement; Human computation; Hybrid computation; Managing concerns; Prorogued programming; Workflow improvement

Indexed keywords

EXECUTABLE REFINEMENT; HUMAN COMPUTATION; HYBRID COMPUTATION; MANAGING CONCERNS; WORKFLOW IMPROVEMENT;

COMPUTER PROGRAMMING LANGUAGES; DESIGN; EXPERIMENTS;

ADA (PROGRAMMING LANGUAGE);

EID: 84869802635     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2384592.2384595     Document Type: Conference Paper

References (35)

1. M. Bayne, R. Cook, and M. D. Ernst. Always-available static and dynamic feedback. In ICSE, 2011.
2. R. Bodik, S. Chandra, J. Galenson, D. Kimelman, N. Tung, S. Barman, and C. Rodarmor. Programming with angelic nondeterminism. In POPL, 2010.
3. F. P. Brooks. The mythical man-month - essays on software engineering (2nd ed.). Addison-Wesley, 1995.
4. S. Chandra, E. Torlak, S. Barman, and R. Bodik. Angelic debugging. In ICSE, 2011.
5. D. Chapman. A program testing assistant. Commun. ACM, 25(9):625-634, Sept. 1982.
6. M. Czerwinski, E. Horvitz, and S. Wilhite. A diary study of task switching and interruptions. In CHI, pages 175-182, 2004.
7. M. de Icaza, M. Safar, S. Peterson, B. Maurer, S. Pouliot, H. Raja, and M. Baulig. Mono C# compiler. http://www.monoproject.com/CSharp-Compiler, December 2010.
8. E. W. Dijkstra. On the role of scientific thought. Published as EWD:EWD447, Aug. 1974.
9. B. N. Freeman-Benson and A. Borning. Integrating constraints with an object-oriented language. In ECOOP, pages 268-286, 1992.
10. S. Gulwani. Dimensions in program synthesis. In FMCAD, 2010.
11. S. Gulwani. Automating string processing in spreadsheets using input-output examples. In POPL, 2011.
12. W. R. Harris and S. Gulwani. Spreadsheet table transformations from examples. In POPL, 2011.
13. A. Hejlsberg, M. Torgersen, S. Wiltamuth, and P. Golde. C# language specification, 2010.
14. J. Henry C. Baker and C. Hewitt. The incremental garbage collection of processes. In Proceedings of the 1977 Symposium on Artificial Intelligence and Programming Languages, pages 55-59, 1977.
15. S. T. Iqbal and E. Horvitz. Disruption and recovery of computing tasks: field study, analysis, and directions. In CHI, pages 677-686, 2007.
16. L. Jiang and Z. Su. Automatic mining of functionally equivalent code fragments via random testing. In ISSTA, pages 81-92, 2009.
17. G. Kiczales, J. Lamping, A. Mendhekar, C. Maeda, C. Lopes, J.-M. Loingtier, and J. Irwin. Aspect-oriented programming. In ECOOP, pages 220-242, 1997.
18. T. A. Lau, P. Domingos, and D. S.Weld. Version space algebra and its application to programming by demonstration. In ICML, pages 527-534, 2000.
19. T. A. Lau, P. Domingos, and D. S. Weld. Learning programs from traces using version space algebra. In K-CAP, pages 36-43, 2003.
20. T. A. Lau, S. A. Wolfman, P. Domingos, and D. S. Weld. Programming by demonstration using version space algebra. Machine Learning, 53(1-2):111-156, 2003.
21. O. A. L. Lemos, S. K. Bajracharya, J. Ossher, P. C. Masiero, and C. V. Lopes. A test-driven approach to code search and its application to the reuse of auxiliary functionality. Information & Software Technology, 53(4):294-306, 2011.
22. O. A. L. Lemos, S. K. Bajracharya, J. Ossher, R. S. Morla, P. C. Masiero, P. Baldi, and C. V. Lopes. CodeGenie: using test-cases to search and reuse source code. In ASE, 2007.
23. H. Lieberman and C. Hewitt. A session with tinker: Interleaving program testing with program design. In Proceedings of the 1980 ACM conference on LISP and functional programming, LFP '80, pages 90-99, New York, NY, USA, 1980. ACM.
24. A. Milicevic, D. Rayside, K. Yessenov, and D. Jackson. Unifying execution of imperative and declarative code. In ICSE, pages 511-520, 2011.
25. S. P. Reiss. Semantics-based code search. In ICSE, pages 243-253, 2009.
26. H. Samimi, E. D. Aung, and T. D. Millstein. Falling back on executable specifications. In ECOOP, pages 552-576, 2010.
27. A. Solar-Lezama, G. Arnold, L. Tancau, R. Bodik, V. Saraswat, and S. Seshia. Sketching stencils. In PLDI, 2007.
28. A. Solar-Lezama, C. G. Jones, and R. Bodik. Sketching concurrent data structures. In PLDI, 2008.
29. A. Solar-Lezama, R. Rabbah, R. Bodík, and K. Ebcioǧlu. Programming by sketching for bit-streaming programs. In PLDI, 2005.
30. A. Solar-Lezama, L. Tancau, R. Bodik, S. Seshia, and V. Saraswat. Combinatorial sketching for finite programs. In ASPLOS, 2006.
31. L. von Ahn, M. Blum, N. J. Hopper, and J. Langford. CAPTCHA: Using hard AI problems for security. In EUROCRYPT, pages 294-311, 2003.
32. L. von Ahn and L. Dabbish. Labeling images with a computer game. In CHI, 2004.
33. L. von Ahn, B. Maurer, C. McMillen, D. Abraham, and M. Blum. reCAPTCHA: Human-based character recognition via web security measures. Science, Sept. 2008.
34. N. Wirth. Program development by stepwise refinement. CACM, 1971.
35. I. H. Witten and D. Mo. TELS: Learning text editing tasks from examples, pages 183-203. MIT Press, Cambridge, MA, USA, 1993.