Pages that link to "Item:Q3763571"
From MaRDI portal
The following pages link to Countable nondeterminism and random assignment (Q3763571):
Displaying 42 items.
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953) (← links)
- Transforming semantics by abstract interpretation (Q557807) (← links)
- On the logic of UNITY (Q673960) (← links)
- ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297) (← links)
- Comparative semantics for flow of control in logic programming without logic (Q805247) (← links)
- Equational reasoning about nondeterministic processes (Q911801) (← links)
- Comparative metric semantics for concurrent PROLOG (Q915474) (← links)
- Contractions in comparing concurrency semantics (Q919834) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- Ten years of Hoare's logic: A survey. II: Nondeterminism (Q1056534) (← links)
- Merging regular processes by means of fixed-point theory (Q1082070) (← links)
- While-programs with nondeterministic assignments and the logic ALNA (Q1082808) (← links)
- A complete rule for equifair termination (Q1088401) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- Metric semantics for concurrency (Q1113660) (← links)
- Interpretations of recursion under unbounded nondeterminacy (Q1115173) (← links)
- The \(\mu\)-calculus as an assertion-language for fairness arguments (Q1124314) (← links)
- Completing the temporal picture (Q1176248) (← links)
- The expressive power of indeterminate dataflow primitives (Q1201292) (← links)
- A logic of recursion (Q1262303) (← links)
- A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- The weakest precondition calculus: Recursion and duality (Q1346768) (← links)
- A relation algebraic model of robust correctness (Q1350502) (← links)
- Full abstraction and recursion (Q1365671) (← links)
- A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
- Soundness of data refinement for a higher-order imperative language (Q1605184) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- Strong fairness and full abstraction for communicating processes (Q1854396) (← links)
- The origins of structural operational semantics (Q1878710) (← links)
- Precise interprocedural dependence analysis of parallel programs (Q1884938) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Computing polynomial program invariants (Q2390319) (← links)
- A unified rule format for bounded nondeterminism in SOS with terms as labels (Q2403821) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- An abstract interpretation-based model for safety semantics (Q2995468) (← links)
- Semantic models for total correctness and fairness (Q5887518) (← links)
- A category-theoretic semantics for unbounded indeterminacy (Q5887523) (← links)
- Sequential algorithms for unbounded nondeterminism (Q5971404) (← links)
