Schema-guided synthesis of imperative programs by constraint solving

Lecture Notes in Computer Science

Volumn 3573, Issue , 2005, Pages 166-181

  Colón, Michael A ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; CONSTRAINT THEORY; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING;

CONSTRAINT SOLVING; IMPERATIVE PROGRAMS; POLYNOMIAL FUNCTIONS; SCHEMA-GUIDED SYNTHESIS;

COMPUTER PROGRAMMING;

EID: 26444441311     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11506676_11     Document Type: Conference Paper

References (24)

1. P. Anderson and D. Basin. Program development schemata as derived rules. Journal of Symbolic Computation, 30(1):5-36, 2000.
2. D. Basin, Y. Deville, P Flener, A. Hamfelt, and J. F. Nilsson. Synthesis of programs in computational logic. In M. Bruynooghe and K.-K. Lau, editors, Program Development in Computational Logic, pages 30-65. Springer-Verlag, 2004.
3. T. Becker and V. Weispfenning. Gröbner Bases: A Computational Approach to Commutative Algebra. Springer-Verlag, New York, 1993.
4. J. F. Canny, E. Kaltofen, and L. Yagati. Solving systems of non-linear polynomial equations faster. In G. H. Gonnet, editor, International Symposium on Symbolic and Algebraic Computation, pages 121-128. ACM Press, 1989.
5. M. Colon, S. Sankaranarayanan, and H. Sipma. Linear invariant generation using non-linear constraint solving. In F. Somenzi and W. Hunt Jr, editors, 15th International Conference on Computer Aided Verification, pages 420-432. Springer-Verlag, 2003.
6. M. A. Colón and H. B. Sipma. Synthesis of linear ranking functions. In T. Margaria and W. Yi, editors, 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 67-81. Springer-Verlag, 2001.
7. E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1976.
8. P. Flener. Achievements and prospects of program synthesis. In A. C. Kakas and F. Sadri, editors, Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, pages 310-346. Springer-Verlag, 2002.
9. P. Flener and Y. Deville. Towards stepwise, schema-guided synthesis of logic programs. In T. P. Clement and K.-K. Lau, editors, International Workshop on Logic Program Synthesis and Transformation, pages 46-64. Springer-Verlag, 1992.
10. P. Flener, K.-K. Lau, M. Ornaghi, and J. Richardson. An abstract formalization of correct schemas for program synthesis. Journal of Symbolic Computation, 30(1):93-127, 2000.
11. R. W. Floyd. Assigning meanings to programs. In Proceedings of the Symposium on Applied Mathematics, volume 19 (Mathematical Aspects of Computer Science), pages 19-32. 1967.
12. L. Granvilliers. RealPaver User's Manual. Institut de Recherche en Informatique de Nantes, 0.3 edition, July 2003.
13. Z. Manna. Mathematical Theory of Computation. McGraw-Hill, New York, 1974.
14. Z. Manna and R. J. Waldinger. Fundamentals of deductive program synthesis. IEEE Transactions on Software Engineering, 18(8):674-704, 1992.
15. E. Mayr and A. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics, 46(3):305-329, 1982.
16. G. C. Necula. Proof-carrying code. In 24th ACM Symposium on Principles of Programming Languages, pages 106-119. ACM, 1997.
17. A. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, Cambridge, 1990.
18. C. Rich and R. C. Waters. Approaches to automatic programming. Advances in Computers, 37:1-57, 1993.
19. S. Sankaranarayanan, H. B. Sipma, and Z. Manna. Non-linear loop invariant generation using Gröbner bases. In N. D. Jones and X. Leroy, editors, 31st ACM Symposium on Principles of Programming Languages, pages 318-329. ACM, 2004.
20. A. Schrijver. Theory of Linear and Integer Programming. John Wiley &: Sons, Chichester, 1986.
21. D. R. Smith. KIDS: A semiautomatic program development system. IEEE Transactions on Software Engineering, 16(9): 1024-1043, 1990.
22. J. Stark and A. Ireland. Towards automatic imperative program synthesis through proof planning. In 14th IEEE International Conference on Automated Software Engineering, pages 44-51. IEEE Computer Society, 1999.
23. M. E. Stickel, R. J. Waldinger, M. R. Lowry, T. Pressburger, and I. Underwood. Deductive composition of astronomical software from subroutine libraries. In A. Bundy, editor, 12th International Conference on Automated Deduction, pages 341-355. Springer-Verlag, 1994.
24. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.