论文信息 - An Executon Environment for the Formal Definiton of Ada

An Executon Environment for the Formal Definiton of Ada

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.

[1] Ehud Shapiro,et al. Algorithmic Program Debugging , 1983 .

[2] Egidio Astesiano,et al. The Ada challenge for new formal semantic techniques , 1986 .

[3] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .

[4] Pierre Lescanne,et al. Computer experiments with the REVE term rewriting system generator , 1983, POPL '83.

[5] Gianna Reggio,et al. A Syntax-Directed Approach to the Semantics of Concurrent Languages , 1986, IFIP Congress.

[6] Heinrich Hußmann,et al. Unification in Conditional Equational Theories , 1985, European Conference on Computer Algebra.

[7] Stéphane Kaplan,et al. Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[8] Ehud Shapiro,et al. Meta interpreters for real , 1988 .

[9] Steffen Hölldobler. Equational Logic Programming , 1987, SLP.