The complexity of verification
From MaRDI portal
Publication:2817629
DOI10.1145/195058.195194zbMath1345.68220OpenAlexW2089056087MaRDI QIDQ2817629
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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (8)
Fuzzy alternating Büchi automata over distributive lattices ⋮ A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata ⋮ Parametric runtime verification is NP-complete and coNP-complete ⋮ An efficient approach for abstraction-refinement in model checking ⋮ Branching-Time Temporal Logics with Minimal Model Quantifiers ⋮ Minimal length test vectors for multiple-fault detection ⋮ From complementation to certification ⋮ Relating word and tree automata
This page was built for publication: The complexity of verification
