Coverability for order-k nested reset counter systems is F_Ωk-complete.
Reasoning about call-by-need by means of types
3 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.
3
Pith papers citing it
1
external citations · Crossref
verdicts
UNVERDICTED 3representative citing papers
Defines a new call-by-silly calculus mirroring call-by-need, proves it shares contextual equivalence with call-by-value, and shows its strategy computes maximal-length sequences via multi types and rewriting.
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.
citing papers explorer
-
The Complexity of Nested Reset Counter Systems
Coverability for order-k nested reset counter systems is F_Ωk-complete.
-
Mirroring Call-by-Need, or Values Acting Silly
Defines a new call-by-silly calculus mirroring call-by-need, proves it shares contextual equivalence with call-by-value, and shows its strategy computes maximal-length sequences via multi types and rewriting.
-
Equilibria in Multiplayer Graph Games: An Algorithmic Study
Provides complexity results for the constrained existence problem of five equilibrium notions in multiplayer graph games.