Workflow views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is carefully designed, it may not preserve the dataflow be- tween tasks in the workflow, i.e., it may not be sound. Un-sound views can be misleading and cause incorrect prove- nance analysis. This paper studies the problem of eficiently identifying and correcting unsound workflow views with minimal changes. In particular, given a workflow view, we wish to split each unsound composite task into the minimal number of tasks, such that the resulting view is sound. We prove that this problem is NP-hard by reduction from independent set. We then propose two local optimality conditions (weak and strong), and design polynomial time algorithms for correcting un- sound views to meet these conditions. Experiments show that our proposed algorithms are efective and eficient, and that the strong local optimality algorithm produces better solutions than the weak local optimality algorithm with little processing overhead.