Pages that link to "Item:Q4023579"
From MaRDI portal
The following pages link to Programs, Recursion and Unbounded Choice (Q4023579):
Displaying 17 items.
- Multirelations with infinite computations (Q406449) (← links)
- Simulation refinement for concurrency verification (Q541209) (← links)
- Completeness of fair ASM refinement (Q541210) (← links)
- Normal design algebra (Q844885) (← links)
- Repetitions, known or unknown? (Q1183432) (← links)
- Nondeterminacy and recursion via stacks and games (Q1318704) (← links)
- Proof rules for recursive procedures (Q1329196) (← links)
- Fixpoint semantics and simulation (Q1575253) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- Safety and progress of recursive procedures (Q1903075) (← links)
- UNITY and Büchi automata (Q2026375) (← links)
- Set-Theoretic Models of Computations (Q2842623) (← links)
- Lazy Relations (Q3498411) (← links)
- Syntactic translations and provably recursive functions (Q3722497) (← links)
- Predicate calculus and program semantics (Q4692630) (← links)
- Completeness of ASM Refinement (Q5403462) (← links)
- Partial correctness for probabilistic demonic programs (Q5958768) (← links)