Skip to main content
SpringerLink
Log in

An execution environment for the formal definition of Ada

  • X — Tools For ADA
  • Conference paper
  • First Online:
ESEC '87 (ESEC 1987)

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

Included in the following conference series:

Abstract

This work proposes an execution environment for the formal definition of Ada, as produced by the project "The Draft Formal Definition of ANSI/MIL-STD-1815A Ada". The environment is based on a logic programming approach, that is the translation of the formal definition itself in an executable logic program. The aim of this construction is to evaluate the feasibility and the effectiveness of an interpreter based on the formal definition.

The use of novel techniques like metaprogramming and partial evaluation in order to improve the modularity and the efficiency of the system is also explored.

This work is partially funded by the Commission of the European Communities under the Multi-Annual Programme in the field of Data-Processing, project No. 782. "The Draft Formal Definition of ANSI/MIL-STD 1815A Ada".

Ada is a registered trademark of the U.S. Government, Ada Joint Program Office

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. "The Formal Definition of Ada Dynamic Semantics", Deliverables 15 and 16 of the CEC MAP project: The Draft Formal Definition of ANSI/MIL-STD 1815A Ada.

    Google Scholar 

  2. Astesiano, E., Giovini, A., Inverardi, P., Mazzanti, F., Reggio, G. and Zucca, E. "Final Specification Language", Deliverable 9 of the CEC MAP project: The Draft Formal Definition of ANSI/MIL-STD 1815A Ada.

    Google Scholar 

  3. Astesiano, E., Giovini, A., Mazzanti, F., Reggio, G. and Zucca, E. "The Ada Challenge for new Formal Semantic Techniques". Proc. Ada-Europe Conference, Edinburgh, (1986).

    Google Scholar 

  4. Astesiano, E. and Reggio, G. "A Syntax-Directed Approach to the Semantics of Concurrent Languages". Proc. 10th IFIP Wold Congress, Dublin, (1986), pp.571–576.

    Google Scholar 

  5. Fantechi, A., Gnesi, S., Inverardi, P., Mazzanti, F., "Feasibility of a mapping from the Ada Formal Definition to the NYU SETL Interpreter for Ada", Deliverable 30 of the CEC MAP project: The Draft Formal Definition of ANSI/MIL-STD 1815A Ada.

    Google Scholar 

  6. Fantechi, A., Gnesi, S., Inverardi, P., Mazzanti, F., "Feasibility of ACVC validation with respect to the Ada Formal Definition", Deliverable 30 of the CEC MAP project: The Draft Formal Definition of ANSI/MIL-STD 1815A Ada.

    Google Scholar 

  7. Gallo, T., Giovini, A., Manfredi, F., Papa, M.P., "Ada FD Tool set: Architecture and Preliminary Design", Deliverable 20 of the CEC MAP project: The Draft Formal Definition of ANSI/MIL-STD 1815A Ada.

    Google Scholar 

  8. Huet, G., Oppen, D.C., "Equations and Rewrite Rules — A survey" in Book, R.V. ed., "Formal Language Theory", Academic Press, New York 1980.

    Google Scholar 

  9. Hussmann, H., "Unification in Conditional-Equational Theories", EUROCAL'85, LNCS 204, 543–553.

    Google Scholar 

  10. Kaplan, S., "Conditional Rewrite Rules", Theoretical Computer Science, 33, 2–3, (1984), 175–193.

    Google Scholar 

  11. Lescanne, P., "Computer Experiments with the REVE Term Rewriting System Generator", Proc. 10th Symp. on Principles of Programming Languages, ACM, Austin TX, USA, 1983, 99–108.

    Google Scholar 

  12. Shapiro, E., "Algorithmic Program Debugging", MIT Press, Cambridge, Massachussetts, (1982).

    Google Scholar 

  13. Safra, S., Shapiro, E., "Meta Interpreters for Real". Proc. 10th IFIP Wold Congress, Dublin, (1986) pp.271–278.

    Google Scholar 

  14. Stirling, L., "Expert System = Knowledge + Meta-interpreter", Dept. of Applied Mathematics, The Weizmann Institute of Science, Internal Report CS84-17.

    Google Scholar 

  15. van Emden, M. H., Yukawa, K., "Equational logic programming", Dept. of Comp. Sci., University of Waterloo, Canada, Technical Report CS-86-05, March 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. I.E.I. - C.N.R., Via S. Maria 46, Pisa, Italy

    A. Fantechi, S. Gnesi & P. Inverardi

  2. Dipartimento di Informatica, University of Pisa, Corso Italia 40, 156100, Pisa, Italy

    U. Montanari

Authors
  1. A. Fantechi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Gnesi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Inverardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. U. Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Howard Nichols Dan Simpson

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fantechi, A., Gnesi, S., Inverardi, P., Montanari, U. (1987). An execution environment for the formal definition of Ada. In: Nichols, H., Simpson, D. (eds) ESEC '87. ESEC 1987. Lecture Notes in Computer Science, vol 289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022125

Download citation

  • DOI: https://doi.org/10.1007/BFb0022125

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48117-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation