Grammar-based program generation based on model finding
Authors:
- 1 December 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- Testing Static Analyzers with Randomly Generated Programs2012
- Finding and understanding bugs in C compilers2011
- Verifying UML/OCL models using Boolean satisfiability2010
- Verification and validation of declarative model-to-model transformations through invariantsJournal of Systems and Software, 2010
- Grammar-based whitebox fuzzing2008
- Verification of UML/OCL Class Diagrams using Constraint Programming2008
- UML2Alloy: A Challenging Model Transformation2007
- Directed test generation using symbolic grammars2007
- Reasoning on UML class diagramsArtificial Intelligence, 2005
- TestEra: Specification-Based Testing of Java Programs Using SATAutomated Software Engineering, 2004