Coverability for order-k nested reset counter systems is F_Ωk-complete.
Title resolution pending
3 Pith papers cite this work, alongside 4 external citations. Polarity classification is still indexing.
3
Pith papers citing it
4
external citations · Crossref
verdicts
UNVERDICTED 3representative citing papers
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
DiOS is a modular model OS for fully reproducible POSIX program execution across verification platforms like DiVM and KLEE and as a user-mode kernel.
citing papers explorer
-
The Complexity of Nested Reset Counter Systems
Coverability for order-k nested reset counter systems is F_Ωk-complete.
-
Infinite State Model Checking by Learning Transitive Relations
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
-
Reproducible Execution of POSIX Programs with DiOS
DiOS is a modular model OS for fully reproducible POSIX program execution across verification platforms like DiVM and KLEE and as a user-mode kernel.