The complexity of verification

DOI10.1145/195058.195194MaRDI QIDQ2817629zbMATH OpenOpenAlexFDO

Authors R. P. Kurshan

Publication date 1 September 2016

Published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/195058.195194

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(8)

• Fuzzy alternating Büchi automata over distributive lattices
• Minimal length test vectors for multiple-fault detection
• From complementation to certification
• Relating word and tree automata
• Branching-Time Temporal Logics with Minimal Model Quantifiers
• Parametric runtime verification is NP-complete and coNP-complete
• A unified approach for showing language inclusion and equivalence between various types of -automata
• An efficient approach for abstraction-refinement in model checking

This page was built for publication: The complexity of verification

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