Compositional higher-order model checking via ω -regular games over Böhm trees

DOI10.1145/2603088.2603133zbMath1401.68207OpenAlexW2074585352MaRDI QIDQ4635663

No author found.

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2603088.2603133

zbMATH Keywords

game semanticsintersection typehigher-order model checkingBöhm tree

Mathematics Subject Classification ID

Games involving graphs (91A43) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Typing Weak MSOL Properties ⋮ Automata, Logic and Games for the $$\lambda $$ -Calculus ⋮ Unnamed Item ⋮ Streett Automata Model Checking of Higher-Order Recursion Schemes

This page was built for publication: Compositional higher-order model checking via ω -regular games over Böhm trees