Executing the formal definition of Ada

Authors:
A. Fantechi;S. Gnesi;F. Leggio;P. Talini
Affiliations:
I.E.I. - C.N.R.- Via S. Maria 46, 156126 Pisa - Italy;I.E.I. - C.N.R.- Via S. Maria 46, 156126 Pisa - Italy;Consorzio Pisa Ricerche - Via Risorgimento 9, 156126 Pisa - Italy;IBM - SEMEA - Florence - Italy
Venue:
ACM SIGPLAN Notices
Year:
1991

Citing 4
Cited 0

The Ada challenge for new formal semantic techniques

Proc. of the Ada-Europe international conference on Ada: managing the transition
An execution environment for the formal definition of Ada

Proc. of the 1st European Software Engineering Conference on ESEC '87
An interpreter for LOTOS, a specification language for distributed systems

Software—Practice & Experience
Algorithmic Program DeBugging

Algorithmic Program DeBugging

Quantified Score

Hi-index	0.00

Visualization

Abstract

The results of a study on the effectiveness of an execution environment for the formal definition of Ada are presented. The environment is based on a logic programming approach, that is the translation of the formal definition into an executable logic program. Some experimental performance measurements for a prototype execution environment which has been developed using the same approach for a simple concurrent language are given, and their usefulness in predicting the performance of the environment for the formal definition of Ada is discussed.