A complete refinement procedure for regular separability of context-free languages

Often, when analyzing the behaviour of systems modelled as context-free languages, we wish to know if two languages overlap. To this end, we present a class of semi-decision procedures for regular separability of context-free languages, based on counter-example guided abstraction refinement. We propose two effective instances of this approach, one that is complete but relatively expensive, and one that is inexpensive and sound, but for which we do not have a completeness proof. The complete method will prove disjointness whenever the input languages are regularly separable. Both methods will terminate whenever the input languages overlap. We provide an experimental evaluation of these procedures, and demonstrate their practicality on a range of verification and language-theoretic instances. •We give a novel semi-decision procedure for regular separability of CFLs.•The procedure makes use of counter-example guided abstraction refinement.•It halts for pairs of CFLs that either overlap or are regularly separable.•We show the method's utility on practical software verification tasks.