SEDGE: Symbolic example data generation for dataflow programs

Kaituo Li, Christoph Reichenbach, Yannis Smaragdakis, Yanlei Diao, Christoph Csallner

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

15 Citations (SciVal)


Exhaustive, automatic testing of dataflow (esp. mapreduce) programs has emerged as an important challenge. Past work demonstrated effective ways to generate small example data sets that exercise operators in the Pig platform, used to generate Hadoop map-reduce programs. Although such prior techniques attempt to cover all cases of operator use, in practice they often fail. Our SEDGE system addresses these completeness problems: for every dataflow operator, we produce data aiming to cover all cases that arise in the dataflow program (e.g., both passing and failing a filter). SEDGE relies on transforming the program into symbolic constraints, and solving the constraints using a symbolic reasoning engine (a powerful SMT solver), while using input data as concrete aids in the solution process. The approach resembles dynamic-symbolic (a.k.a. 'concolic') execution in a conventional programming language, adapted to the unique features of the dataflow domain. In third-party benchmarks, SEDGE achieves higher coverage than past techniques for 5 out of 20 PigMix benchmarks and 7 out of 11 SDSS benchmarks and (with equal coverage for the rest of the benchmarks). We also show that our targeting of the high-level dataflow language pays off: for complex programs, state-of-the-art dynamic-symbolic execution at the level of the generated map-reduce code (instead of the original dataflow program) requires many more test cases or achieves much lower coverage than our approach.

Original languageEnglish
Title of host publication2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Proceedings
Number of pages11
Publication statusPublished - 2013 Dec 1
Externally publishedYes
Event2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Palo Alto, CA, United States
Duration: 2013 Nov 112013 Nov 15


Conference2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013
Country/TerritoryUnited States
CityPalo Alto, CA

Subject classification (UKÄ)

  • Computer Science


  • data flow analysis
  • program testing
  • programming languages
  • reasoning about programs
  • specification languages


Dive into the research topics of 'SEDGE: Symbolic example data generation for dataflow programs'. Together they form a unique fingerprint.

Cite this