KIT | KIT-Bibliothek | Impressum | Datenschutz

Efficient Path Conditions in Dependence Graphs

Robschink, Torsten; Snelting, Gregor

Program slicing combined with constraint solving is a powerful tool for software analysis. Path conditions are generated for a slice or chop, which -- when solved for the input variables -- deliver compact "witnesses" for dependences or illegal influences between program points. In this contribution we show how to make path conditions work for large programs. Aggressive engineering, based on interval analysis and BDDs, is shown to overcome the potential combinatoric explosion. Case studies and empirical data will demonstrate the usefulness of path conditions for practical program analysis.

Zugehörige Institution(en) am KIT Institut für Programmstrukturen und Datenorganisation (IPD)
Publikationstyp Proceedingsbeitrag
Publikationsjahr 2002
Sprache Englisch
Identifikator ISBN: 1-58113-472-X
KITopen-ID: 1000017650
Erschienen in Proceedings of the 24th International Conference of Software Engineering (ICSE), Orlando, Florida May 19 - 25, 2002. Ed.: W. Tracz
Verlag ACM, Orlando (FL)
Seiten 478 - 488
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page