Model checking and higher-order recursion

DOI10.1007/3-540-48340-3_14MaRDI QIDQ4941897zbMATH OpenFDO

Authors Hardi Hungar

Publication date 28 May 2001

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

Full work available at URL https://doi.org/10.1007/3-540-48340-3_14

zbMATH Keywords

context-free graphsmacro graphsmonadic second-order logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On infinite transition graphs having a decidable monadic theory
• scientific article; zbMATH DE number 2102748
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 2087432
• scientific article; zbMATH DE number 4049098

Cited in

(3)

• Saturation-Based Model Checking of Higher-Order Recursion Schemes.
• scientific article; zbMATH DE number 5825969 (Why is no real title available?)
• scientific article; zbMATH DE number 1796143 (Why is no real title available?)

This page was built for publication: Model checking and higher-order recursion

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