Article

Schema-guided synthesis of imperative programs by constraint solving

Author:

Michael A. ColónAuthors Info & Claims

LOPSTR'04: Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation

Pages 166 - 181

https://doi.org/10.1007/11506676_11

Published: 26 August 2004 Publication History

Abstract

We present a method for schema-guided synthesis of imperative programs computing polynomial functions and their inverses. The schemas of our approach contain parameters representing both fragments of code and fragments of invariants, and they generate programs annotated with loop invariants establishing partial correctness. Schema application entails simultaneously instantiating the code parameters to polynomials and the invariant parameters to systems of polynomial equalities. By bounding the degrees of these polynomials and their number, our method reduces schema instantiation to non-linear constraint solving, based on the theory of polynomial ideals. Although non-linear constraint solving is NP-hard, a solution can be generated automatically when the resulting system contains few constraints. A specialization of our method yields linear constraints by further restricting the form of the invariants. This restriction improves the efficiency of constraint solving, but may fail to synthesize programs derivable by the general method.

References

[1]

P. Anderson and D. Basin. Program development schemata as derived rules. Journal of Symbolic Computation, 30(1):5-36, 2000.

Digital Library

[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.

Digital Library

[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.

Digital Library

[5]

M. Colón, 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.

Digital Library

[7]

E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1976.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[14]

Z. Manna and R. J. Waldinger. Fundamentals of deductive program synthesis. IEEE Transactions on Software Engineering, 18(8):674-704, 1992.

Digital Library

[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.

Digital Library

[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.

Digital Library

[20]

A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, Chichester, 1986.

Digital Library

[21]

D. R. Smith. KIDS: A semiautomatic program development system. IEEE Transactions on Software Engineering, 16(9):1024-1043, 1990.

Digital Library

[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.

Digital Library

[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.

Digital Library

[24]

A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.

Cited By

Li YSun M(2023)Challenges Engaging Formal CBSE in Industrial ApplicationsFormal Aspects of Component Software10.1007/978-3-031-52183-6_8(153-167)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-52183-6_8
Leike JTiwari A(2014)Synthesis for Polynomial Lasso ProgramsProceedings of the 15th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 831810.1007/978-3-642-54013-4_24(434-452)Online publication date: 19-Jan-2014
https://dl.acm.org/doi/10.1007/978-3-642-54013-4_24
Srivastava SGulwani SFoster J(2013)Template-based program verification and program synthesisInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-012-0223-415:5-6(497-518)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1007/s10009-012-0223-4
Show More Cited By

Index Terms

Schema-guided synthesis of imperative programs by constraint solving
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on polynomials
2. Theory of computation
  1. Logic

Index terms have been assigned to the content through auto-classification.

Recommendations

Solving dynamic constraint optimization problems using ICHEA
ICONIP'12: Proceedings of the 19th international conference on Neural Information Processing - Volume Part III

Many real-world constrained problems have a set of predefined static constraints that can be solved by evolutionary algorithms (EAs) whereas some problems have dynamic constraints that may change over time or may be received by the problem solver at run ...
A synthesis of constraint satisfaction and constraint solving
CP'03: Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming

This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspired some constraint programming languages, it has some weaknesses that leave it not ...
Constraint Preserving Transformation from Relational Schema to XML Schema

XML has become the standard for publishing and exchanging data on the Web. However, most business data is managed and will remain to be managed by relational database management systems. As such, there is an increasing need to efficiently and accurately ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

LOPSTR'04: Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation

August 2004

278 pages

ISBN:3540266550

Editor:
Sandro Etalle
University of Twente, The Netherlands

Sponsors

University of Verona: University of Verona
The Association for Logic Programming: The Association for Logic Programming

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 August 2004

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li YSun M(2023)Challenges Engaging Formal CBSE in Industrial ApplicationsFormal Aspects of Component Software10.1007/978-3-031-52183-6_8(153-167)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-52183-6_8
Leike JTiwari A(2014)Synthesis for Polynomial Lasso ProgramsProceedings of the 15th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 831810.1007/978-3-642-54013-4_24(434-452)Online publication date: 19-Jan-2014
https://dl.acm.org/doi/10.1007/978-3-642-54013-4_24
Srivastava SGulwani SFoster J(2013)Template-based program verification and program synthesisInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-012-0223-415:5-6(497-518)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1007/s10009-012-0223-4
Wintersteiger CHamadi Yde Moura LBloem RSharygina N(2010)Efficiently solving quantified bit-vector formulasProceedings of the 2010 Conference on Formal Methods in Computer-Aided Design10.5555/1998496.1998539(239-246)Online publication date: 20-Oct-2010
https://dl.acm.org/doi/10.5555/1998496.1998539
Srivastava SGulwani SFoster J(2010)From program verification to program synthesisACM SIGPLAN Notices10.1145/1707801.170633745:1(313-326)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.1145/1707801.1706337
Srivastava SGulwani SFoster JHermenegildo MPalsberg J(2010)From program verification to program synthesisProceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/1706299.1706337(313-326)Online publication date: 17-Jan-2010
https://dl.acm.org/doi/10.1145/1706299.1706337
de Moura LBjørner N(2010)Bugs, moles and skeletonsProceedings of the 5th international conference on Automated Reasoning10.1007/978-3-642-14203-1_34(400-411)Online publication date: 16-Jul-2010
https://dl.acm.org/doi/10.1007/978-3-642-14203-1_34

View Options

View options

Media

Figures

Other

Tables

View Table of Contents