Data flow analysis work over a control flow graph. When a language under consideration supports exceptions, control flow graph can explode. 

What are the standard techniques for dealing with this blow-up?
Can we soundly disregard edges induced by exception? Data flow analyses anyhow compute over-approximations, so we would end up with a less precise but sound solution. Is this true? 

**Update**: Here are few useful links that I was able to dig out at the end:

 - [Analysis and Testing of Programs with Excpetion-Handling Constructs][1]
 - [Efficient And Precise Modeling of Exceptions for Analysis of Java Programs][2]


  [1]: https://smartech.gatech.edu/bitstream/handle/1853/6581/GIT-CC-00-04.pdf?sequence=1
  [2]: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.43.8105&rep=rep1&type=pdf