Meta-interpretation of recursive list-processing programs

Authors:
Daniel Goossens
Affiliations:
Universite PARIS VIII, Paris
Venue:
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
Year:
1979

Citing 2
Cited 0

A new approach to program testing

Proceedings of the international conference on Reliable software
SELECT—a formal system for testing and debugging programs by symbolic execution

Proceedings of the international conference on Reliable software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Presented Is an implemented program understanding system called CAN. CAN relies on a meta-interpretation process which brings to light two new concepts concerning meta-interpretation of recursive programs: vicious circles and constructive induction. These notions express CAN's ability to extract from program code classes of data for which Interpretation of the code would not stop, and in general, to relate classes of data with abstract values and environments.