Countable nondeterminism and random assignment
From MaRDI portal
(Redirected from Publication:3763571)
Recommendations
Cited in
(59)- Ten years of Hoare's logic: A survey. II: Nondeterminism
- Merging regular processes by means of fixed-point theory
- While-programs with nondeterministic assignments and the logic ALNA
- A complete rule for equifair termination
- A calculus of refinements for program derivations
- Metric semantics for concurrency
- Interpretations of recursion under unbounded nondeterminacy
- The \(\mu\)-calculus as an assertion-language for fairness arguments
- Completing the temporal picture
- The expressive power of indeterminate dataflow primitives
- A logic of recursion
- A fully abstract semantics for concurrent constraint programming
- Nonexpressibility of fairness and signaling
- The weakest precondition calculus: Recursion and duality
- A relation algebraic model of robust correctness
- Full abstraction and recursion
- A methodology for designing proof rules for fair parallel programs
- Soundness of data refinement for a higher-order imperative language
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- Strong fairness and full abstraction for communicating processes
- The origins of structural operational semantics
- Precise interprocedural dependence analysis of parallel programs
- Verification of concurrent programs: The automata-theoretic framework
- Fifty years of Hoare's logic
- Computing polynomial program invariants
- A unified rule format for bounded nondeterminism in SOS with terms as labels
- A domain equation for bisimulation
- Step-indexed relational reasoning for countable nondeterminism
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
- Step-indexed relational reasoning for countable nondeterminism
- An abstract interpretation-based model for safety semantics
- Counting successes: effects and transformations for non-deterministic programs
- Hiding Software Watermarks in Loop Structures
- scientific article; zbMATH DE number 1231604 (Why is no real title available?)
- A Case Study in Abstract Interpretation Based Program Transformation
- Extensional and intensional semantics of bounded and unbounded nondeterminism
- A fully abstract game semantics for countable nondeterminism
- Generated models and the -rule: the nondeterministic case
- On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics
- \(m\)-algebraic lattices in formal concept analysis
- Transforming semantics by abstract interpretation
- Semantic models for total correctness and fairness
- A category-theoretic semantics for unbounded indeterminacy
- Foundations of Software Science and Computation Structures
- Sequential algorithms for unbounded nondeterminism
- Liminf progress measures
- Verified exact real computation with nondeterministic functions and limits
- Two guarded recursive powerdomains for applicative simulation
- On the logic of UNITY
- When is a bottom-up deterministic tree translation top-down deterministic?
- Alignment complete relational Hoare logics for some and all
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Comparative semantics for flow of control in logic programming without logic
- Equational reasoning about nondeterministic processes
- Comparative metric semantics for concurrent PROLOG
- Contractions in comparing concurrency semantics
- Modelling higher-order dual nondeterminacy
- Alternating states for dual nondeterminism in imperative programming
- Dual unbounded nondeterminacy, recursion, and fixpoints
This page was built for publication: Countable nondeterminism and random assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763571)
