scientific article; zbMATH DE number 7361952

MaRDI QIDQ4994932zbMATH OpenFDO

Authors Arnaud Carayol, Matthew Hague

Publication date 22 June 2021

Full work available at URL https://arxiv.org/abs/1405.5593, http://eptcs.web.cse.unsw.edu.au/paper.cgi?AFL2014.1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(8)

• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
• Saturation-Based Model Checking of Higher-Order Recursion Schemes.
• Saturation of Concurrent Collapsible Pushdown Systems
• A Saturation Method for Collapsible Pushdown Systems
• COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES
• scientific article; zbMATH DE number 7471692 (Why is no real title available?)
• Decidability Results for Saturation-Based Model Building
• On the complexity of multi-pushdown games

This page was built for publication:

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