An Automatic Generator for Compiler Testing

Authors:
F. Bazzichi;I. Spadafora
Affiliations:
Istituto di Scienze dell'Informazione, University of Pisa, Pisa, Italy, and with the Computing Center, CNUCE;-
Venue:
IEEE Transactions on Software Engineering
Year:
1982

Citing 0
Cited 11

Automated testing using executable formal specifications

SEEP '96 Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)
Generating Test Cases from an OO Model with an AI Planning System

ISSRE '99 Proceedings of the 10th International Symposium on Software Reliability Engineering
Increased Software Reliability Through Input Validation Analysis and Testing

ISSRE '99 Proceedings of the 10th International Symposium on Software Reliability Engineering
Planner Based Error Recovery Testing

ISSRE '00 Proceedings of the 11th International Symposium on Software Reliability Engineering
Automated testing of refactoring engines

Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Systematic Testing of Model-Based Code Generators

IEEE Transactions on Software Engineering
Testing input validation in Web applications through automated model recovery

Journal of Systems and Software
Covering code behavior on input validation in functional testing

Information and Software Technology
Automatic generation of random self-checking test cases

IBM Systems Journal
Automatic generation of random self-checking test cases

IBM Systems Journal
Sleuth: a domain based testing tool

ITC'94 Proceedings of the 1994 international conference on Test

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new method for testing compilers is presented. The compiler is exercized by compilable programs, automatically generated by a test generator. The generator is driven by a tabular description of the source language. This description is in a formalism which nicely extends context-free grammars in a context-dependent direction, but still retains the structure and readability of BNF. The generator produces a set of programs which cover all grammatical constructions of the source language, unless user supplied directives instruct otherwise. The programs generated can also be used to evaluate the performance of different compilers of the same source language.