Using models to model-check recursive schemes

DOI10.2168/LMCS-11(2:7)2015MaRDI QIDQ2941755zbMATH OpenOpenAlexFDO

Authors S. Salvati, Igor Walukiewicz

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 semanticshigher-order model checkingsimply typed lambda-calculustree automata

Mathematics Subject Classification ID

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

Recommendations

• Using models to model-check recursive schemes
• Simple Models for Recursive Schemes
• Model checking higher-order programs
• Model checking and functional program transformations
• A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata

Cited in

(9)

• scientific article; zbMATH DE number 1670550 (Why is no real title available?)
• Simple Models for Recursive Schemes
• A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
• scientific article; zbMATH DE number 1796143 (Why is no real title available?)
• Recursion schemes, the MSO logic, and the \textsf{U} quantifier
• Domains for Higher-Order Games
• Using models to model-check recursive schemes
• Complexity of model checking recursion schemes for fragments of the modal mu-calculus
• Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus

This page was built for publication: Using models to model-check recursive schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941755)