article

Free access

Transformational derivation of programs using the focus system

Author:

Uday S. ReddyAuthors Info & Claims

ACM SIGSOFT Software Engineering Notes, Volume 13, Issue 5

Pages 163 - 172

https://doi.org/10.1145/64137.65019

Published: 03 November 1988 Publication History

PDF eReader

References

[1]

BALZER, R., CHEATHAM, E.J., AND GREEN, C. Software technology in the 1990's: Using a new paradigm. IEEE Computer 16 (Nov. 1983), 39-45.

Digital Library

Google Scholar

[2]

BALZER, R., GOLDMAN, N. M., AND WILE, D. S. On the transformational approach to programming. In Proc. 2nd Intern. Conf. on Softw. Eng. (19761, IEEE, pp. 337-344.

Digital Library

Google Scholar

[3]

BURSTALL, R. M., AND DARLINGTON, J. A transformation system for developing recursive programs. J. ACM 24, 1 (Jan. 1977), 44-67.

Digital Library

Google Scholar

[4]

CHEATHAM, T. E., HOLLOWAY, G. H., AND TOWNLEY, J. A. Symbolic evaluation and the analysis of programs. IEEE Trans. Softw. Eng. SE-5, 4 (July 1979), 402-417.

Digital Library

Google Scholar

[5]

CLARKE, L. A. A system to generate test data and symbolically execute programs. IEEE Trans. Softw. Eng. SE-2, (Sep 1976), 21'5-222.

Google Scholar

[6]

COLMERAUER, A., KANOURI, H., PASERO, R., AND Rous- SEL, P. Un Systeme de Communication Homme-machine en Francais. Research Report, Groupe Intelligence Axtificielle, Universite Aix-Marseille II, 1973.

Google Scholar

[7]

CONSTABLE, R. Constructive mathematics and automatic program writers. In IFIP (Ljublijana, .Yugoslavia, Aug. 1971), pp. 229-233.

Google Scholar

[8]

DARLINGTON, J. Transforming specifications into efficient programs. In IFIP Working G&p 2.1 Conf. on Softw. Specifications (St. Pierre-de-Chatreuse, France., 1976).

Google Scholar

[9]

DARLINGTON, J. The structured description of algorithm derivations. In Algorithmic Languages, J. W. de Bakker and J. C. van Vliet, Eds., North-Holland, 1981, pp. 221-250.

Google Scholar

[10]

DERSHOWITZ, N. Synthesis by completion. In IJCAI (Los Angeles, 1985), pp. 208-214.

Google Scholar

[11]

DERSHOWITZ, N., AND PLAISTED, D. A. Logic programming cum applicative progr amming. In Symposium on Logic PTogmmming (1985), IEEE.

Google Scholar

[12]

FEATHER, M. S. A System GOT Developing Programs by Transfonation. PhD thesis, Univ. of Edinburgh, 1979.

Google Scholar

[13]

FEATHER, M. S. A system for assisting program transformation. ACM Trans. Program. Lang. Syst. 4, 1 (1982), l-20.

Digital Library

Google Scholar

[14]

GOGUEN, J. A., AND MESEGUER, J. Equality, types, modules and generics for logic programming. In Pmt. 2nd Intern. Logic Prog. Conf., Uppsala (1984), pp. 115-125.

Google Scholar

[15]

GUTTAG, J. V., AND HORNING, J. J. Report on the Larch shared language. Science of Computer Programming 6, 2 (March 1986), 103-157.

Digital Library

Google Scholar

[16]

HAMMERSLAG, D. Treemacs Manual. Tech. Rep. UHJCDCS-R-88-1427, Univ. Illinois at Urbana-Champaign, May 1988.

Google Scholar

[17]

HAMMERSLAG, D. H., KAMIN, S. N., AND CAMPBELL, R. H. Tree-oriented interactive processing with an application to theorem-proving. In Second Conf. on Softw. Dew. Tools, Techniques, and Alternatives (1985), IEEE Computer Society Press, pp. 199-206.

Digital Library

Google Scholar

[18]

HUET, G., AND OPPEN, D. C. Equations and rewrite rules: a survey. In Formal Language Theory: Perspectives and Open Problems, R. Book, Ed., Academic Press, New York, 1980, pp. 349-405.

Crossref

Google Scholar

[19]

KOWALSKI, R. A. Logic for Problem Solving. North- Holland, 1979.

Digital Library

Google Scholar

[20]

MANNA, Z., AND WALDINGER, R. Synthesis: Dreams =$ programs. IEEE Trans. Softwarn Engineering SE-S, 4 (1979), 294-328.

Digital Library

Google Scholar

[21]

MANNA, Z., AND WALDINGER, R. A deductive approach to program synthesis. ACM Trans. Pmgmm. Lang. Syst. 2, 1 (Jan. 1980), 90-121.

Digital Library

Google Scholar

[22]

MILNER, R. A proposal for Standard ML. In ACM Symp. on LISP and Functional Program. (1984), pp. 184-197.

Digital Library

Google Scholar

[23]

O'DONNELL, M. J. Equational Logic as u Programming Languuge. MIT Press, 1985.

Digital Library

Google Scholar

[24]

PEYTON-JONES, S. L. The Implementation of Functional Programming Languages. Prentice-Hail International, 1987.

Google Scholar

[25]

REDDY, U. S. Narrowing as the operational semantics of functional languages. In Symp. on Logic Pmgram. (Boston, 1985), IEEE, pp. 138-151.

Google Scholar

[26]

REDDY, U. S. On the relationship between logic and functional languages. In Logic Programming: Functions, Relations and Equations, D. DeGroot and G. Lindstrom, Eds., Prentice-Hall, 1986, pp. 3-36.

Google Scholar

[27]

REDDY, U. S. Functional logic languages, Part I. In Graph Reduction, Springer-Verlag, 1987, pp. 401-425. (Lecture Notes in Computer Science, Vol 279).

Digital Library

Google Scholar

[28]

REDDY, U. S. Rewriting techniques foT pmgmm synthesis and inductive theorem proving. Preprint, Univ. Illinois at Urbana-Champaign, Nov. 1987.

Google Scholar

[29]

REDDY, U. S. Program transformation without folding. Preprint, Univ. iliinois at Urbana-Champaign, Jan. 1988.

Google Scholar

[30]

REDDY, U. S. Applicative Techniques for Imperative Programs. Draft, Univ. Ilhnois at Urbana-Champaign, July 1988.

Google Scholar

[31]

REDDY, U. S. Design principles for an interactive program derivation system. In Proc. AAAI-88 Workshop on Automating Software Design (1988), AAAI. (to appear).

Google Scholar

[32]

RICH, C., AND WATERS, R. C. Artificial Intelligence and Software Engineering. Morgan Kaufman+ 1986.

Digital Library

Google Scholar

[33]

ROBINSON, J. A. A machine-oriented logic based on the resolution principle. J. ACM li? (1965), 23-41.

Digital Library

Google Scholar

[34]

SCHERLIS, W. L. Programimprovement by internal specialization. In ACM Symp. on Print. of Program. Lang. (1981), ACM, pp. 41-49.

Digital Library

Google Scholar

[35]

TAMAKI, H., AND SATO, T. Unfold/fold transformation of logic programs. ln Intern. Conf. on Logic Program. (Uppda, 1984), pp. 127-138.

Google Scholar

[36]

TEITELBAUM, T., AND REPS, T. The Cornell program synthesizer: A syntax-directed programming environment. Commun. ACM 24, 9 (Sept 1981), 563-573.

Digital Library

Google Scholar

[37]

TURCHIN, V. F. The concept of a supercompiier. ACM Trans. Program. Lang, Syst. 8, 3 (1986), 292-325.

Digital Library

Google Scholar

[38]

TURNER, D. Miranda: a non-strict functional language with polymorphic types. In Conf. on Functional Program. Lang. and Comput. Architecture (1985), J. Jouannaud, Ed., Springer-Verlag, pp. 1-16.

Digital Library

Google Scholar

[39]

WATERS, R. The programmer's apprentice: A session with KBEmacs. IEEE TTans. Softw. Eng. SE-II, 11 (Nov. 1985), 1296-1320.

Digital Library

Google Scholar

[40]

WILE, D. S. Program developments: Formal explanations of implementations. Comm. ACM 26, 11 (1983), 902-911.

Digital Library

Google Scholar

Cited By

View all

Dershowitz NReddy U(1993)Deductive and inductive synthesis of equational programsJournal of Symbolic Computation10.1016/S0747-7171(06)80002-715:5-6(467-494)Online publication date: 1-May-1993
https://dl.acm.org/doi/10.1016/S0747-7171%2806%2980002-7
Lano KHaughton H(2006)A specification‐based approach to maintenanceJournal of Software Maintenance: Research and Practice10.1002/smr.43600304033:4(193-213)Online publication date: 30-Oct-2006
https://doi.org/10.1002/smr.4360030403
Bellegarde F(2005)A transformation system combining partial evaluation with term rewritingHigher-Order Algebra, Logic, and Term Rewriting10.1007/3-540-58233-9_3(40-55)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-58233-9_3
Show More Cited By

Index Terms

Transformational derivation of programs using the focus system
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees
2. Software and its engineering
  1. Software notations and tools
    1. Development frameworks and environments

Recommendations

A transformational approach to the derivation of hardware algorithms from recurrence equations
Supercomputing '88: Proceedings of the 1988 ACM/IEEE conference on Supercomputing

Hardware algorithms have a significant impact on the supercomputing of matrix computation and signal processing. In this paper, we propose a new approach to the derivation of hardware algorithms from recurrence equations, which is based on program ...
A Transformational Derivation of a Parsing Algorithm in a High-Level Language

This paper presents a detailed algorithm derivation scenario, using correctness preserving source-to-source transfonnations. The algorithm derived is the Cocke-Younger nodal spans parsing algorithm. We describe a high-level SETL-like specification ...
Transformational derivation of programs using the focus system
SDE 3: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes

ACM SIGSOFT Software Engineering Notes Volume 13, Issue 5

Special issue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on practical software development environments

November 1988

257 pages

ISSN:0163-5948

DOI:10.1145/64137

Editor:
Peter Henderson
SUNY, Stonybrook, NY

Issue’s Table of Contents

SDE 3: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
January 1989
257 pages
ISBN:089791290X
DOI:10.1145/64135
Editor:
Peter Henderson
SUNY, Stonybrook, NY

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 November 1988

Published in SIGSOFT Volume 13, Issue 5

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
315
Total Downloads

Downloads (Last 12 months)70
Downloads (Last 6 weeks)19

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dershowitz NReddy U(1993)Deductive and inductive synthesis of equational programsJournal of Symbolic Computation10.1016/S0747-7171(06)80002-715:5-6(467-494)Online publication date: 1-May-1993
https://dl.acm.org/doi/10.1016/S0747-7171%2806%2980002-7
Lano KHaughton H(2006)A specification‐based approach to maintenanceJournal of Software Maintenance: Research and Practice10.1002/smr.43600304033:4(193-213)Online publication date: 30-Oct-2006
https://doi.org/10.1002/smr.4360030403
Bellegarde F(2005)A transformation system combining partial evaluation with term rewritingHigher-Order Algebra, Logic, and Term Rewriting10.1007/3-540-58233-9_3(40-55)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-58233-9_3
Bronsard FReddy U(2005)Conditional rewriting in focusConditional and Typed Rewriting Systems10.1007/3-540-54317-1_77(1-13)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-54317-1_77
Bellegarde F(2005)Program transformation and rewritingRewriting Techniques and Applications10.1007/3-540-53904-2_99(226-239)Online publication date: 7-Jun-2005
https://doi.org/10.1007/3-540-53904-2_99
Bronsard FReddy U(2005)Axiomatization of a functional logic languageAlgebraic and Logic Programming10.1007/3-540-53162-9_33(101-116)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-53162-9_33
Reddy U(2005)Term rewriting induction10th International Conference on Automated Deduction10.1007/3-540-52885-7_86(162-177)Online publication date: 9-Jun-2005
https://doi.org/10.1007/3-540-52885-7_86
Reddy U(2005)Rewriting techniques for program synthesisRewriting Techniques and Applications10.1007/3-540-51081-8_121(388-403)Online publication date: 31-May-2005
https://doi.org/10.1007/3-540-51081-8_121
Reddy U(1990)Formal methods in transformational derivation of programsACM SIGSOFT Software Engineering Notes10.1145/99571.9982815:4(104-114)Online publication date: 1-Apr-1990
https://dl.acm.org/doi/10.1145/99571.99828
Eggert P(1990)Toward special-purpose program verificationACM SIGSOFT Software Engineering Notes10.1145/99571.9980715:4(25-29)Online publication date: 1-Apr-1990
https://dl.acm.org/doi/10.1145/99571.99807
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

A transformational approach to the derivation of hardware algorithms from recurrence equations

A Transformational Derivation of a Parsing Algorithm in a High-Level Language