Language inclusion algorithms as complete abstract interpretations
From MaRDI portal
Publication:6536285
DOI10.1007/978-3-030-32304-2_8zbMATH Open1539.68134MaRDI QIDQ6536285
Francesco Ranzato, Pedro Valero, Pierre Ganty
Publication date: 19 April 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On regularity of context-free languages
- Well quasi-orders and regular languages
- Nested antichains for WS1S
- Well-quasi-orders and regular \(\omega\)-languages
- Petri nets and regular processes
- Trace inclusion for one-counter nets revisited
- Complete Abstractions Everywhere
- Checking NFA equivalence with bisimulations up to congruence
- Sound up-to techniques and Complete abstract domains
- Making abstract interpretations complete
- On context-free languages and push-down automata
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Well-structured transition systems everywhere!
This page was built for publication: Language inclusion algorithms as complete abstract interpretations
