Lattice-theoretic progress measures and coalgebraic model checking
From MaRDI portal
Publication:2828316
DOI10.1145/2837614.2837673zbMath1347.68227arXiv1511.00346OpenAlexW2282180738MaRDI QIDQ2828316
Shunsuke Shimizu, Ichiro Hasuo, Corina Cîrstea
Publication date: 24 October 2016
Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.00346
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items (5)
Universal algorithms for parity games and nested fixpoints ⋮ Unnamed Item ⋮ Combining semilattices and semimodules ⋮ Quasipolynomial computation of nested fixpoints ⋮ Coinductive predicates and final sequences in a fibration
This page was built for publication: Lattice-theoretic progress measures and coalgebraic model checking