Skip to main content

A Formal Model of Instruction Set Semantics

  • Conference paper
  • 35 Accesses

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 53))

Abstract

In order to automate compiler construction beyond semantic analysis, it is necessary to have a formal framework wherein the properties of the target machine may be expressed precisely, such that they become amenable to automatic treatment. We present a formal model of instruction sets that defines a precise semantics to the concepts encountered on the machine code level: register and storage structure, addressing modes and side effects, instructions, flag settings and so on. We give a number of examples to illustrate how the model can serve in the automatic generation of target machine dependent compiler parts.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BeN7H C.G. Bell, A. Newell: Computer Structures: Readings and Examples, McGraw-Hill, 1971

    Google Scholar 

  2. R.G.G. Cattell: Formalization and Automatic Derivation of Code Generators, Report CMU-CS-78-115, Carnegie Mellon University, Pittsburgh 1978

    Google Scholar 

  3. P. Cousot, R. Cousot: Systematic Design of Program Analysis Frameworks, Proceedings of 6th ACM Symposium on Principles of Programming Languages, 1979, pp. 269–282

    Google Scholar 

  4. H. Ganzinger: Some Principles for the Development of Compiler Descriptions from Denotational Language Definitions, TUM-INFO 8006, Institut für Informatik, Technical University Munich, 1980

    Google Scholar 

  5. Gie81] R. Giegerich: Automatische Erzeugung von Maschinencode-Optimierern, TUM-I8112, Institut für Informatik, Technical University Munich, 1981 (an English summary appears in [Gie82])

    Google Scholar 

  6. R. Giegerich: Automatic Generation of Machine Specific Code Optimizers, Proceedings of 9th ACM Symposium on Principles of Programming Languages, 1982

    Google Scholar 

  7. R.S. Glanville: A Machine Independent Algorithm for Code Generation and its Use in Retargetable Compilers, Technical report UCB-CS-78-01, University of California, Berkeley 1978

    Google Scholar 

  8. M. Ganapathi: Retargetable Code Generation and Optimization Using Attribute Grammars, Computer sciences technical report #406, University of Wisconsin, Madison, 1980

    Google Scholar 

  9. Hil80] W. Hilf, Motorola Munich, private communication

    Google Scholar 

  10. W.M. McKeeman: Peephole Optimization, CACM 8,7, 1965, pp. 443–444

    Google Scholar 

  11. Motorola Inc.: MC68000 16 Bit Microprocessor, User Manual, 1979

    Google Scholar 

  12. B.W. Leverett, R.G.G. Cattell, S.O. Hobbs, J.M. Newcomer, A.H. Reiner, B.R. Schatz, W.A. Wulf: An Overview of the Production Quality Compiler-Compiler Project, IEEE Computer, Aug. 1980, pp. 38–49

    Google Scholar 

  13. K. Ripken: Formale Beschreibung von Maschinen, Implementierungen und optimie- render Maschinencodeerzeugung aus attributierten Programm-graphen, TUM-INFO 7731. Institut für Informatik, Technical University Munich, 1977

    Google Scholar 

  14. W. Schürer: Erarbeitung einer Hierarchie von Schnittstellen für die Codeerzeugung für verschiedene Microcomputer, Diplomarbeit, Institut für Informatik, Technical University Munich, 1979

    Google Scholar 

  15. J.E. Stoy: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge (Mass. ), 1977

    Google Scholar 

  16. W.M. Waite: Code Generation, in: F.L. Bauer, J. Eickel (eds.): Compiler Construction — An Advanced Course, Lecture Notes in Computer Science No. 25, Springer 1974

    Google Scholar 

  17. W.A. Wulf, R.K. Johnsson. C.B. Weinstock, S.O. Hobbs, C.M. Geschke: The Design of an Optimizing Compiler, American Elsevier, New York 1975

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giegerich, R. (1982). A Formal Model of Instruction Set Semantics. In: Wössner, H. (eds) Programmiersprachen und Programmentwicklung. Informatik-Fachberichte, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68355-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-68355-8_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11204-4

  • Online ISBN: 978-3-642-68355-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics