Home › Entities › academia › Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs

Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs

Research article (Proceedings of the ACM on Programming Languages, 2017) · cited 66× · AI/ML
academia openalex:W2755806184
Press Enter · cited answer in seconds

Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs

Summary

Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs is a scholarly article[1].

Key Facts

  • Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs's instance of is recorded as scholarly article[2].

Related Entities

Krishnendu Chatterjee

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. Retrieved May 24, 2026, from https://4ort.xyz/entity/lexicographic-ranking-supermartingales-an-efficient-approach-to-termination-of-probabilistic-programs
MLA “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/lexicographic-ranking-supermartingales-an-efficient-approach-to-termination-of-probabilistic-programs.
BibTeX @misc{4ortxyz_lexicographic-ranking-supermartingales-an-efficient-approach-to-termination-of-probabilistic-programs_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs}}, year = {2026}, url = {https://4ort.xyz/entity/lexicographic-ranking-supermartingales-an-efficient-approach-to-termination-of-probabilistic-programs}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs — https://4ort.xyz/entity/lexicographic-ranking-supermartingales-an-efficient-approach-to-termination-of-probabilistic-programs (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/lexicographic-ranking-supermartingales-an-efficient-approach-to-termination-of-probabilistic-programs · Last refreshed: