Thumbnail
Access Restriction
Open

Author Robschink, Torsten ♦ Snelting, Gregor
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Practical Program Analysis ♦ Illegal Influence ♦ Path Condition ♦ Empirical Data ♦ Software Analysis ♦ Program Slicing ♦ Compact Witness ♦ Constraint Solving ♦ Input Variable ♦ Interval Analysis ♦ Aggressive Engineering ♦ Po-tential Combinatoric Explosion ♦ Program Point ♦ Large Program ♦ Efficient Path Condition ♦ Dependence Graph ♦ Pow-erful Tool ♦ Case Study
Description Program slicing combined with constraint solving is a pow-erful tool for software analysis. Path conditions are gener-ated 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 po-tential combinatoric explosion. Case studies and empirical data will demonstrate the usefulness of path conditions for practical program analysis. 1.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2002-01-01
Publisher Institution In Proceedings International ACM/IEEE Conference on Software Engineering (ICSE’02