skip to main content
10.1145/318593.318634acmconferencesArticle/Chapter ViewAbstractPublication PagespoplConference Proceedingsconference-collections
Article
Free Access

A greedy concurrent approach to incremental code generation

Authors Info & Claims
Published:01 January 1985Publication History

ABSTRACT

The PSEP System represents a novel approach to incremental compilation for block structured languages. PSEP implements a very fine grain, “greedy” approach as a highly concurrent system of two processes: an editor and a code generator. The design allows the two processes to execute without locking their shared data objects, utilizing semantic information about the concurrent system to guarantee the consistency of the shared objects. This design is compared with the more common “demand” approach to incremental compilation.

References

  1. [1] P. H. Feiler, "A Language-Oriented Interactive Programming Environment Based on Compilation Technology", {Ph.D. Dissertation}, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania (May 1982). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. [2] P. Fritzson, "Fine-Grained Incremental Compilation for Pascal-Like Languages", Technical Report S-581-83, Software Systems Research Center, Linkoping Institute of Technology, Linkoping, Sweden (July 1982).Google ScholarGoogle Scholar
  3. [3] P. Fritzson, "A Systematic Approach to Advanced Debugging through Incremental Compilation", Proc. SIGSOFT/SIGPLAN Software Engineering Symposium on High-Level Debugging {A.C.M. SIGPLAN Notices, Vol.18, No. 8 (Aug. 1983)}, pp. 130-139. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] P. Fritzson, "Preliminary Experience from the DICE System, A Distributed Incremental Compiling Environment", Proc. A. C. M. SIGSOFT/SIGPLAN Software Engineering Symp. on Practical Software Development Environments {A.C.M. SIGPLAN Notices}, Vol. 9, No. 3 (May 1984)}, pp. 113-123. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [5] H. T. Kung and P. L. Lehman, "Concurrent Manipulation of Binary Search Trees", A.C.M. Trans. on Database Systems, Vol. 5, No. 3 (Sept. 1980), pp. 354-383. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] P. Lehman and S. Yao, "Efficient Locking for Concurrent Operations on B-trees", A.C.M. Trans. on Database Systems, Vol. 6, No. 4 (Dec. 1981), pp. 650-670. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. [7] R. Medina-Mora, "Syntax-directed Editing: Towards Integrated Programming Environment", Technical Report 82-113, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania (March 1982). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] R. Medina-Mora and P. H. Feiler, "An Incremental Programming Environment", I.E.E.E. Trans. on Software Engineering, Vol. SE-7, No. 5 (Sept. 1981), pp. 472-482.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [9] K. V. Nori, U. Ammann, K. Jensen, H. H. Nageli and Ch. Jacobi, "Pascal-P Implementation Notes" in Pascal The language and its Implementation, D. W. Barron (ed.), (John Wiley and Sons Ltd., New York, 1981), pp. 125-170.Google ScholarGoogle Scholar
  10. [10] D. Sawamiphakdi, "A Multiprocess Design for an Integrated Programming Environment", {Ph.D. Dissertation), Technical Report 84-07, Department of Computer Science, University of Iowa, Iowa City, Iowa (July 1984). Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [11] T. Teitelbaum, "The Cornell Program Synthesizer: A Microcomputer Implementation of PL/CS", Technical Report 79-390, Department of Computer Science, Cornell University, Ithaca, New York (June 1979). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. [12] T. Teitelbaum and T. Reps, "The Cornell Program Synthesizer: A Syntax-directed Programming Environment", Comm. A.C.M., Vol. 24, No. 9 (Sept. 1981), pp. 563-573. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. [13] T. Teitelbaum, T. Reps and S. Horwitz, "The Why and Wherefore of the Cornell Program Synthesizer", Proc. A.C.M. SIGPLAN/SIGOA Symp. on Text Manipulation, A.C.M. SIGPLAN Notices, Vol. 16 (June 1981), pp. 8-16. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A greedy concurrent approach to incremental code generation

        Recommendations

        Comments

        Login options

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

        Sign in
        • Published in

          cover image ACM Conferences
          POPL '85: Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
          January 1985
          340 pages
          ISBN:0897911474
          DOI:10.1145/318593

          Copyright © 1985 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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 January 1985

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate824of4,130submissions,20%

          Upcoming Conference

          POPL '25

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader