Cited By
View all- Andras PCharlton B(2005)Self-Aware Software – Will It Become a Reality?Self-star Properties in Complex Information Systems10.1007/11428589_16(229-259)Online publication date: 2005
Automatic program generation using sequent calculus
Pages 73 - 82
Abstract
Program development can be made amenable to formal methods by using a logical framework. A logic specification, whose operational semantics is based on proof theory, provides an abstract and “implementation independent” definition of the problem, the data domains and the associated operators.
Unlike many of the current efforts in this area that use resolution, our approach is based on natural deduction, more specifically, sequent calculus. Following the methodology proposed by Manna and Waldinger, we propose the synthesis tableau technique by which we construct a proof for the well formed formula representing the specification. The desired program is obtained as a side effect of the proof process.
References
[1]
A. Barr and E. Feigenbaun (Eds), The Handbook of Artificial Intelligence, Vol. 2, Chapter X, William Kaufmann Inc., pp. 297-325, 1982.
[2]
A. Biermann, "Approaches to Automatic Programming," in Advances in Computers, Vol. 15, pp. 1-63, Academic Press, 1976.
[3]
W. Bledsoe, "The LIT Prover," Math Department Memo ATP-17B, University of Texas At Austin, April 1983.
[4]
E. Cohen, Programming in the 1990s: An Introduction to The Calculation of Programs, Springer- Verlag, 1990.
[5]
R. Constable and M. O'Donnell, A Programming Logic with An Introduction to The PLICV VerOqer, Winthrop Publisher, Inc., 1978.
[6]
E. Dijkstra, A Discipline of Programming, Prentice-Hall, 1976.
[7]
G. Dromey, Program Derivation" The Development of Programs from SpecCications, Addison- Wesley, 1989.
[8]
R. Goldblatt, "Axiomatising The Logic Of Computer Programming," Lecture Notes in Computer Science, Vol. 130, Springer-Verlag, 1982.
[9]
F. Golshani, W. Scott and P. White, "Languages for Intelligent Specifw.ation Systems," Proc. of IEEE International Conference on Computer Languages, Miami Beach, FL, pp 304-311, 1988.
[10]
S. Goto, "Program Synthesis through Goders Interpretation," Proc. of the Int. Conference on Mathematical Studies of Information Processing, pp. 302- 325, 1978.
[11]
S. Goto, "Program Synthesis from Natural Deduction Proofs," proc. of Int.Joint Conference on Artificial Intelligence, pp. 339-341, 1979.
[12]
C. Green, "Application of Theorem Proving to Problem Solving," proc. oflJCAl, pp. 219-239, 1969.
[13]
T. Maghrabi, "Generating Programs from Natural Deduction Proofs," Proc. of The First Golden West Conference on Intelligence Systems, Reno, Nevada, pp. 150-156, June 1991.
[14]
T. Maghrabi, "The Synthesis Tableau: An Automatic Programming Approach Using Sequent Calculus," Ph. D dissertation, Delmrtment of Computer Sc~ and Engineering, Arizona State University, 1992.
[15]
Z. Manna and R. Waldinger, "A Deductive A~h to Progrmn Synthesis," ACM Transactions on Programming Languages and Systems, (2), pp. 90-121, 1980.
[16]
Z. Manna and R. Waldinger, The Logical Basis for Computer Programming, Vol. 2, Addison-Wesley, 1985.
[17]
L. Paulson, Logic and Computation: Interactive Proofs with Cambridge LCF, Cambridge University Press, 1987.
[18]
M. Sato, "Towards A Mathematical Theory of Program Synthesis," proc. of Int.loint Conference on ArtCicial Intelligence, pp. 757-762, 1979.
[19]
G. Schulmeyer, Zero Defect Software, McGraw- Hill, 1990.
[20]
M. Szabo (Ed.), The Collected Papers of Gerhard Gentzen, North-Holland Publishing Company, pp. 68-128, 1969.
[21]
R. Waldinger and R. Lee, "PROW: A Step Toward Automatic Program Writing," proc. of IJCAI, pp. 241-252, 1969.
[22]
L. Wos, R. Overbeek, E. Lusk and J. Boyle, Automated Reasoning: Introduction and Applications, Prentice-Hall, 1984.
Index Terms
- Automatic program generation using sequent calculus
Recommendations
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
WoLLIC '09: Proceedings of the 16th International Workshop on Logic, Language, Information and ComputationWe give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-free intuitionistic sequent calculus as formal system and by combining ...
A calculus of multiary sequent terms
Multiary sequent terms were originally introduced as a tool for proving termination of permutative conversions in cut-free sequent calculus. This work develops the language of multiary sequent terms into a term calculus for the computational (Curry-...
Non-classical Elegance for Sequent Calculus Enthusiasts
In this paper we develop what we can describe as a "dual two-sided" cut-free sequent calculus system for the non-classical logics of truth lp, k 3, stt and a non-reflexive logic ts which is, arguably, more elegant than the three-sided sequent calculus ...
Comments
Information & Contributors
Information
Published In
April 1992
574 pages
Copyright © 1992 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 April 1992
Check for updates
Qualifiers
- Article
Conference
CSC92
Sponsor:
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 314Total Downloads
- Downloads (Last 12 months)42
- Downloads (Last 6 weeks)10
Reflects downloads up to 08 Feb 2025
Other Metrics
Citations
Cited By
View all- Andras PCharlton B(2005)Self-Aware Software – Will It Become a Reality?Self-star Properties in Complex Information Systems10.1007/11428589_16(229-259)Online publication date: 2005
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in