Trickle: Automated infeasible path detection using all minimal unsatisfiable subsets

@article{Blackham2014TrickleAI,
  title={Trickle: Automated infeasible path detection using all minimal unsatisfiable subsets},
  author={Bernard Blackham and Mark H. Liffiton and Gernot Heiser},
  journal={2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)},
  year={2014},
  pages={169-178}
}
Static analysis techniques can be used to compute safe bounds on the worst-case execution time (WCET) of programs. For large programs, abstractions are often required to curb computational complexity. These abstractions may introduce infeasible paths which result in significant overestimation. These paths can be eliminated by adding additional constraints to the static analysis. Such constraints can be found manually but this is labour-intensive and error-prone. Automated methods of finding… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 28 REFERENCES

SMTbased false positive elimination in static program analysis

  • R. Huuck, A. Fehnker, M. Junker, A. Knapp
  • ICFEM, Kyoto, Japan, Nov , Conference Paper, pp…
  • 2012
2 Excerpts

Similar Papers

Loading similar papers…