Combinatorial sketching for finite programs

International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS

Volumn , Issue , 2006, Pages 404-415

  Solar Lezama, Armando ^a   Tancau, Liviu ^a   Bodik, Rastislav ^a   Seshia, Sanjit ^a   Saraswat, Vijay ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

SAT; Sketching

Indexed keywords

COMBINATORIAL SKETCHING; FINITE PROGRAMS; SOFTWARE SYNTHESIS;

CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; PROBLEM SOLVING; PROGRAM DEBUGGING; TABLE LOOKUP;

COMPUTER PROGRAM LISTINGS;

EID: 34547491806     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1168857.1168907     Document Type: Conference Paper

References (17)

1. D. Andre and S. Russell. Programmable reinforcement learning agents. Advances in Neural Information Processing Systems, 13, 2001. MIT Press.
2. R. M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, 1977.
3. E. Clarke, D. Kroening, and K. Yorav. Behavioral consistency of C and Verilog programs using bounded model checking. In DAC, pages 368-371, May 2003.
4. N. Eén and N. Sörensson. An extensible SAT-solver. In E. Giunchiglia and A. Tacchella, editors, SAT, volume 2919 of Lecture Notes in Computer Science, pages 502-518. Springer, 2003.
5. Advanced encryption standard (AES). U.S. DEPARTMENT OF COMMERCE/National Institute of Standards and Technology, November 2001. http://csrc.nist.gov/ publications/fips/fipsl97/fips-197.pdf.
6. B. Fischer and J. Schumann. Autobayes: a system, for generating data analysis programs from statistical models. Journal of Functional Programming, 13(3):483-508, May 2003.
7. P. V. Hentenryck and V. Saraswat. Strategic directions in constraint programming. ACM Comput. Surv., 28(4):701-726, 1996.
8. R. Joshi, G. Nelson, and K. H. Randall. Denali: A goal-directed superoptimizer. In PLDI, pages 304-314, 2002.
9. Z. Manna and R. J. Waldinger. Toward automatic program synthesis. Commun. ACM, 14(3): 151-165, 1971.
10. A. Mishchenko, S. Chatterjee, and R. Brayton. Dag-aware AIG rewriting: A fresh look at combinational logic synthesis. In DAC '06: Proceedings of the 43rd annual conference on Design automation, pages 532-535, New York, NY, USA, 2006. ACM Press.
11. D. P. Ranjan, D. Tang, and S. Malik. A comparative study of 2qbf algorithms. In The Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), May 2004.
12. E. M. Reingold, J. Nievergelt, and N. Deo. Combinatorial Algorithms - Theory and Practice. Prentice-Hall, 1977.
13. A. Solar-Lezama, R. Rabbah, R. Bodik, and K. Ebcioglu. Programming by sketching for bit-streaming programs. In PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, pages 281-294, New York, NY, USA, 2005. ACM Press.
14. W. Thies, M. Karczmarek, and S. Amarasinghe. Streamit: A language for streaming applications. In International Conference on Compiler- Construction, Grenoble, France, Apr. 2002.
15. H. S. Warren. Hacker's Delight. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2002.
16. P. Wegner. A technique for counting ones in a binary computer. Commun. ACM, 3(5):322, 1960.
17. Y. Xie and A. Aiken. Scalable error detection using boolean satisfiability. In Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 351-363, 2005.