Higher-Order Model Checking: An Overview
From MaRDI portal
Publication:4635787
DOI10.1109/LICS.2015.9zbMath1401.68205OpenAlexW1525341697MaRDI QIDQ4635787
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/lics.2015.9
Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (8)
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond ⋮ Recent advances on reachability problems for valence systems (invited talk) ⋮ Equivalence of pushdown automata via first-order grammars ⋮ Unnamed Item ⋮ Epsilon-reducible context-free languages and characterizations of indexed languages ⋮ General decidability results for asynchronous shared-memory programs: higher-order and beyond ⋮ Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence ⋮ Automata, Logic and Games for the $$\lambda $$ -Calculus
This page was built for publication: Higher-Order Model Checking: An Overview