We define novel algorithms for the inclusion problem between two visibly pushdown
languages of infinite words, an EXPTime-complete problem. Our algorithms search for …

Visibly pushdown automata (VPAs), introduced by Alur and Madhusudan in 2004, are a
useful formalism in various contexts, such as expressing and checking properties on control …

Checking whether one formal language is included in another is important in many
verification tasks. In this article, we provide solutions for checking the inclusion of languages …

Safety verification of while programs is often phrased in terms of inclusions L (A) ⊆ L (B) L
(A)⊆ L (B) among regular languages. Antichain-based algorithms have been developed as …

This open access book constitutes the proceedings of the 29th International Conference on
Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2023, which was …

We introduce an algorithmic framework to decide the language inclusion for languages of
infinite words. We define algorithms for different decidable cases like the inclusion between …

Visibly pushdown automata (VPAs) express properties on structures with a nesting relation
such as program traces with nested method calls. In the context of runtime verification, we …

The antichain algorithm and bounded model checking (BMC) are well-known techniques in
finite model checking framework. However, they are less explored for pushdown model …

This dissertation describes methods for automatically analyzing programs to determine
compatibility of software components. Complex systems today are made up of many …