This paper presents an algorithm that generates test programs in order to test programming languages and domain specific languages using formal methods. The novelty of the approach is that it is embedded into a model driven engineering environment and it is described as a model finding problem. The grammar of the language and the respective test programs are represented as meta-models and models, respectively. As a result, model finders are utilized to generate test programs based on user constraints while additionally ensuring embedded constraints of the programmmg languages. An experimental evaluation demonstrates the applicability of the approach.
['Mathias Soeken', 'Rolf Drechsler']
Grammar-based program generation based on model finding