Efficient Checking of Behavioural Relations and Modal Assertions using Fixed-Point Inversion
Abstract elided by the publisher.
Related papers
- Efficient Evidence Generation for Modal μ-Calculus Model Checking TACAS 2025
- On the origins of bisimulation and coinduction TOPLAS 2009
- Diamonds are not forever: liveness in reactive programming with guarded recursion POPL 2021
- Functional pearl: getting a quick fix on comonads Haskell 2015
- Modal Abstractions for Virtualizing Memory Addresses OOPSLA 2025
- Session Coalgebras: A Coalgebraic View on Regular and Context-free Session Types TOPLAS 2022
- Quantitative analysis of assertion violations in probabilistic programs PLDI 2021
- Modal Abstractions of Concurrent Behaviour SAS 2008