Using models to model-check recursive schemes

DOI10.2168/LMCS-11(2:7)2015zbMath1391.68080OpenAlexW3183609626MaRDI QIDQ2941755

Igor Walukiewicz, Sylvain Salvati

Publication date: 25 August 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-11(2:7)2015

zbMATH Keywords

denotational semanticstree automatahigher-order model checkingsimply typed lambda-calculus

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

Unnamed Item, Domains for Higher-Order Games