Angelic non-determinism

A term coined by C.A.R Hoare, which describes the execution of a non-deterministic program where all choices that are made favor termination.
Wikipedia

Topic mentions per year

Topic mentions per year

2001-2018
0120012018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The hiding operation, crucial in the compositional aspect of game semantics, removes computation paths not leading to observable… (More)
  • figure 1
Is this relevant?
2017
2017
We describe anchored angelic A* (AAA*), an algorithm for efficient and asymptotically near-optimal planning for systems governed… (More)
  • figure 1
  • table I
Is this relevant?
2016
2016
In this article, we consider the termination problem of probabilistic programs with real-valued variables. The questions… (More)
  • table 1
  • figure 1
  • figure 4
  • figure 8
  • figure 6
Is this relevant?
2010
2010
Stepwise refinement is a well-studied technique for developing a program from an abstract description to a concrete… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Conformance checking of a component is a testing method to see if an implementation and its executable specification are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 6
  • figure 8
Is this relevant?