Green: reducing, reusing and recycling constraints in program analysis

@inproceedings{Visser2012GreenRR,
  title={Green: reducing, reusing and recycling constraints in program analysis},
  author={W. Visser and J. Geldenhuys and Matthew B. Dwyer},
  booktitle={SIGSOFT FSE},
  year={2012}
}
  • W. Visser, J. Geldenhuys, Matthew B. Dwyer
  • Published in SIGSOFT FSE 2012
  • Computer Science
  • The analysis of constraints plays an important role in many aspects of software engineering, for example constraint satisfiability checking is central to symbolic execution. However, the norm is to recompute results in each analysis. We propose a different approach where every call to the solver is wrapped in a check to see if the result is not already available. While many tools use some form of results caching, the novelty of our approach is the persistence of results across runs, across… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Directed incremental symbolic execution
    • 195
    • PDF
    A Survey of Symbolic Execution Techniques
    • 154
    • PDF
    Multi-solver Support in Symbolic Execution
    • 54
    • PDF
    Enhancing reuse of constraint solutions to improve symbolic execution
    • 37
    • PDF
    Solving the Search for Source Code
    • 80
    • PDF
    Feedback-driven dynamic invariant discovery
    • 33
    • Highly Influenced
    • PDF

    References

    Publications referenced by this paper.
    CVC3
    • 2007