@inproceedings{10.1007/978-3-030-32304-2_8,
    Abstract = {We study the language inclusion problem {\$}{\$}L{\\_}1 {\backslash}subseteq L{\\_}2{\$}{\$}where {\$}{\$}L{\\_}1{\$}{\$}is regular. Our approach relies on abstract interpretation and checks whether an overapproximating abstraction of {\$}{\$}L{\\_}1{\$}{\$}, obtained by successively overapproximating the Kleene iterates of its least fixpoint characterization, is included in {\$}{\$}L{\\_}2{\$}{\$}. We show that a language inclusion problem is decidable whenever this overapproximating abstraction satisfies a completeness condition (i.e. its loss of precision causes no false alarm) and prevents infinite ascending chains (i.e. it guarantees termination of least fixpoint computations). Such overapproximating abstraction function on languages can be defined using quasiorder relations on words where the abstraction gives the language of all words ``greater than or equal to'' a given input word for that quasiorder. We put forward a range of quasiorders that allow us to systematically design decision procedures for different language inclusion problems such as regular languages into regular languages or into trace sets of one-counter nets. In the case of inclusion between regular languages, some of the induced inclusion checking procedures correspond to well-known state-of-the-art algorithms like the so-called antichain algorithms. Finally, we provide an equivalent greatest fixpoint language inclusion check which relies on quotients of languages and, to the best of our knowledge, was not previously known.},
    Address = {Cham},
    Author = {Ganty, Pierre and Ranzato, Francesco and Valero, Pedro},
    BookTitle = {Static Analysis},
    Editor = {Chang, Bor-Yuh Evan},
    File = {Language Inclusion Algorithms as Complete Abstract Interpretations - a - a - a - f.pdf},
    ISBN = {978-3-030-32304-2},
    Pages = {140--161},
    Publisher = {Springer International Publishing},
    Title = {Language Inclusion Algorithms as Complete Abstract Interpretations},
    Year = {2019},
    date-added = {2020-02-11 20:42:01 +0100},
    date-modified = {2020-02-11 20:42:01 +0100},
    doi = {10.1007/978-3-030-32304-2_8}
}

@inproceedings{10.1007/978-3-030-32304-2_8, Abstract = {We study the language inclusion problem {\$}{\$}L{\}1 {\backslash}subseteq L{\}2{\$}{\$}where {\$}{\$}L{\}1{\$}{\$}is regular. Our approach relies on abstract interpretation and checks whether an overapproximating abstraction of {\$}{\$}L{\}1{\$}{\$}, obtained by successively overapproximating the Kleene iterates of its least fixpoint characterization, is included in {\$}{\$}L{\_}2{\$}{\$}. We show that a language inclusion problem is decidable whenever this overapproximating abstraction satisfies a completeness condition (i.e. its loss of precision causes no false alarm) and prevents infinite ascending chains (i.e. it guarantees termination of least fixpoint computations). Such overapproximating abstraction function on languages can be defined using quasiorder relations on words where the abstraction gives the language of all words ``greater than or equal to'' a given input word for that quasiorder. We put forward a range of quasiorders that allow us to systematically design decision procedures for different language inclusion problems such as regular languages into regular languages or into trace sets of one-counter nets. In the case of inclusion between regular languages, some of the induced inclusion checking procedures correspond to well-known state-of-the-art algorithms like the so-called antichain algorithms. Finally, we provide an equivalent greatest fixpoint language inclusion check which relies on quotients of languages and, to the best of our knowledge, was not previously known.}, Address = {Cham}, Author = {Ganty, Pierre and Ranzato, Francesco and Valero, Pedro}, BookTitle = {Static Analysis}, Editor = {Chang, Bor-Yuh Evan}, File = {Language Inclusion Algorithms as Complete Abstract Interpretations - a - a - a - f.pdf}, ISBN = {978-3-030-32304-2}, Pages = {140--161}, Publisher = {Springer International Publishing}, Title = {Language Inclusion Algorithms as Complete Abstract Interpretations}, Year = {2019}, date-added = {2020-02-11 20:42:01 +0100}, date-modified = {2020-02-11 20:42:01 +0100}, doi = {10.1007/978-3-030-32304-2_8} }