First-Order Model Checking on Generalisations of Pushdown Graphs

zbMath1262.68004arXiv1202.0137MaRDI QIDQ3225588

Alexander Kartzow

Publication date: 22 March 2012

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

zbMATH Keywords

verificationmodel checkingRamsey quantifierstree-automatic structurescollapsible pushdown graphshigher-order nested pushdown trees

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (1)

Tree-Automatic Well-Founded Trees

This page was built for publication: First-Order Model Checking on Generalisations of Pushdown Graphs