A probabilistic runtime extension to typestates adds mutable state, mixed input/output sessions, and monitoring of expected action ratios to model concurrent and quantitative aspects of distributed protocols.
Innermost many-sorted term rewriting on GPUs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Automatic techniques derive upper and lower bounds on parallel complexity of term rewriting by reusing sequential methods, with sufficient criteria for confluence of the parallel-innermost relation, shown via AProVE extension and benchmarks.
citing papers explorer
-
Modelling Distributed Applications with Mixed-Choice Stateful Typestates
A probabilistic runtime extension to typestates adds mutable state, mixed input/output sessions, and monitoring of expected action ratios to model concurrent and quantitative aspects of distributed protocols.
-
On Complexity Bounds and Confluence of Parallel Term Rewriting
Automatic techniques derive upper and lower bounds on parallel complexity of term rewriting by reusing sequential methods, with sufficient criteria for confluence of the parallel-innermost relation, shown via AProVE extension and benchmarks.