Using Models to Model-Check Recursive Schemes

DOI10.1007/978-3-642-38946-7_15zbMath1381.68179arXiv1503.04320OpenAlexW2168984090MaRDI QIDQ5300902

Sylvain Salvati, Igor Walukiewicz

Publication date: 28 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04320

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Recursion Schemes and the WMSO+U Logic ⋮ Typing Weak MSOL Properties ⋮ Simply typed fixpoint calculus and collapsible pushdown automata ⋮ Krivine machines and higher-order schemes

This page was built for publication: Using Models to Model-Check Recursive Schemes