most citedPositive Almost-Sure Termination -- Complexity and Proof Rules

2 citations · 2 across the 1 of their papers we have counts for

collaborators
Showing cs.PLShow all

1 paper · 1 filter

cs.PL2023★ 2 cited

Positive Almost-Sure Termination -- Complexity and Proof Rules

Rupak Majumdar, V. R. Sathiyanarayana

We study the recursion-theoretic complexity of Positive Almost-Sure Termination () in an imperative programming language with rational variables, bounded nondetermin…