Skip to main content
SpringerLink
Log in

Program simplification via symbolic interpretation

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 206))

Abstract

We investigate a specific program transformation technique, called simplification, which is a generalization of the "mixed computation" technique due to Ershov. Our technique allows one to develop truly generalized programs to be reused several times, for particular cases of their expected inputs.

Given a subset D' of an input domain D, specified via predicates on program variables, and a generalized program P, simplification yields a program P' which implements the same transformation as P on input data restriced to D', but is considerably more efficient than P. We give examples and outline the structure of a prototype implementation, which is built on top of a symbolic intepreter for Pascal.

This work has been supported by ESPRIT, Project METEOR, the Italian Research Council (CNR) and by MPI 40%.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V. and J.D. Ullman Principles of Compiler Design Addison Wesley, Reading, MA 1977.

    Google Scholar 

  2. Colombo, M., F. Furlani, G. Geretto "Un Semplificatore di Programmi Pascal Basato su Esecutore Simbolico", Dip. Elettronica, Politecnico di Milano, Tesi di Laurea 1985.

    Google Scholar 

  3. Ershov, A.P. "On The Partial Computation Principle", Information Processing Letters, 6,2, 1977.

    Google Scholar 

  4. Ershov, A.P., "Mixed Computation Potential Applications and Problems for Study", Theoretical Computer Science, 18, 1982.

    Google Scholar 

  5. Kemmerer, R.A., and S.T. Eckmann A User's Manual for the UNISEX System", UCSB, Dept. of Computer Science, TRCS83-05, Dec. 1983.

    Google Scholar 

  6. King, J.C. "Symbolic Execution and Program Testing", Comm. ACM, 19, 7, pp 385–394, July 1976.

    Article  Google Scholar 

  7. Bauer, F. and Wossner, H. "Algorithmic Languadge and Program Development", Springer Verlag, New York 1982.

    Google Scholar 

  8. Partsch, H. and R. Steinbruggen, "Program Transformation Systems", ACM Computing Surveys, 15, 3, pp 199–236, Sept. 1983.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Politecnico di Milano, P.za L. da Vinci 32, Italy

    Carlo Ghezzi, Dino Mandrioli & Antonio Tecchio

Authors
  1. Carlo Ghezzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dino Mandrioli
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio Tecchio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. N. Maheshwari

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghezzi, C., Mandrioli, D., Tecchio, A. (1985). Program simplification via symbolic interpretation. In: Maheshwari, S.N. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1985. Lecture Notes in Computer Science, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16042-6_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-16042-6_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16042-7

  • Online ISBN: 978-3-540-39722-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation