Survey of compiler testing methods

Kossatchev, A. S.; Posypkin, Mikhail

doi:10.1007/s11086-005-0008-6

Cited by 31 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Equivalent assembly of two equivalents in P 142 (Figure 4), After compiling and inputting, the set of outputs is {..., -212, 4, ...}, and there is an unequal element in the set, which proves that the mutant has error. Figure.4 test cases in P 142 Mutate C 31 selects the "genStmt" function in the source code "cgen.cpp" to modify the "p0 = t-> child [0];" statement in "case WhileK" to "p0 = t-> child [1]; "( Figure 5). Equivalent assembly P170 within the two procedures (Figure 6), after compilation and input, the output set contains a program grammar error, to prove that the mutant has error.…”

Section: Methodsmentioning

confidence: 99%

“…If the compiler error can lead to inconsistencies in the source code semantics and executable file behavior, this question is secret and deadly for programmer. In fact, the compiler does have an error [1] . Therefore, testing the correctness of the compiler is critical.…”

Section: Introductionmentioning

confidence: 99%

“…The traditional compiler testing technology tests the under test program by comparing the actual output of the test cases with the expected output [3] , For the compiler testing, in many cases there is a test oracle that it is difficult for the tester to construct the expected output of the program to determine whether the execution result is correct [1,2,7] . At present, the three widely used compiler testing techniques include Randomized Differential Testing (RDT) [8] , a variant of RDT-Different Optimization Levels (DOL) [9] , and Equivalence Modulo Inputs (EMI) [6] .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Compiler Testing Approach based on Generalized Equivalent Substitution

Wu¹,

Zhang²,

Huang³

et al. 2017

Proceedings of the 2017 2nd International Conference on Machinery, Electronics and Control Simulation (MECS 2017)

View full text Add to dashboard Cite

Abstract:The importance of the compiler is unquestionable. In order to better guarantee the correctness of the compiler, this paper presents a compiler testing approach based on generalized equivalent substitution. This approach tests the compiler by building a large number of equivalent assemblies. It can produce more test cases with fewer original test cases and effectively avoid a test oracle. We use the way implanting variants in SNL compilers to verify the validity of the compiler test approach based on generalized equivalence substitution. The experiment results show that our approach is effective and can detect errors in the compiler.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Compiler Testing Approach based on Generalized Equivalent Substitution

Wu¹,

Zhang²,

Huang³

et al. 2017

Proceedings of the 2017 2nd International Conference on Machinery, Electronics and Control Simulation (MECS 2017)

View full text Add to dashboard Cite

show abstract

“…7 Related Work §2 already provided some general background on the established topic of grammarbased testing; we refer to [3,7,8,12,14,15,18,19,20,25] for extensive discussion of methods and applications of grammar-based testing. Our work is original in so .…”

Section: Matching Algorithmmentioning

confidence: 99%

Comparison of Context-Free Grammars Based on Parsing Generated Test Data

Fischer

Lämmel

Zaytsev

2012

Software Language Engineering

View full text Add to dashboard Cite

Abstract. There exist a number of software engineering scenarios that essentially involve equivalence or correspondence assertions for some of the context-free grammars in the scenarios. For instance, when applying grammar transformations during parser development-be it for the sake of disambiguation or grammar-class compliance-one would like to preserve the generated language. Even though equivalence is generally undecidable for context-free grammars, we have developed an automated approach that is practically useful in revealing evidence of nonequivalence of grammars and discovering correspondence mappings for grammar nonterminals. The approach is based on systematic test data generation and parsing. We discuss two studies that show how the approach is used in comparing grammars of open source Java parsers as well as grammars from the course work for a compiler construction class.

show abstract

“…Grammar-based testing is a preferred approach for testing meta programs [5,20]. The input syntax of most meta programs can be modeled precisely using context-free grammars (CFG).…”

Section: Introductionmentioning

confidence: 99%

Reducing the Cost of Grammar-Based Testing Using Pattern Coverage

Hentz

Vinju

Moreira

2015

Testing Software and Systems

View full text Add to dashboard Cite

Abstract. In grammar-based testing, context-free grammars may be used to generate relevant test inputs for language processors, or meta programs, such as programming language compilers, refactoring tools, and implementations of software quality metrics. This technique can be used to test these meta programs, but the amount of sentences, and syntax trees thereof, which needs to be generated to obtain reasonable coverage of the input language is exponential. Pattern matching is a programming language feature used often when writing meta programs. Pattern matching helps because it automates the frequently occurring task of detecting shapes in, and extracting information from syntax trees. However, meta programs which contain many patterns are difficult to test using only randomly generated sentences from grammar rules. The reason is that statistically it is uncommon to directly generate sentences which accidentally match the patterns in the code. To solve this problem, in this paper we extract information from the patterns in the code of meta programs to guide the sentence generation process. We introduce a new coverage criterion, called Pattern Coverage, which focuses on providing a test strategy to reduce the amount of test necessary cases, while covering the relevant parts of the meta program. An initial experimental evaluation is presented and the result is compared with traditional grammar-based testing.

show abstract

Survey of compiler testing methods

Cited by 31 publications

References 10 publications

Compiler Testing Approach based on Generalized Equivalent Substitution

Compiler Testing Approach based on Generalized Equivalent Substitution

Comparison of Context-Free Grammars Based on Parsing Generated Test Data

Reducing the Cost of Grammar-Based Testing Using Pattern Coverage

Contact Info

Product

Resources

About