Fixed-point calculus
From MaRDI portal
Publication:674263
DOI10.1016/0020-0190(94)00195-5zbMATH Open0875.68201OpenAlexW1857353355MaRDI QIDQ674263FDOQ674263
Mathematics of Program Construction Group
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00195-5
Recommendations
Cites Work
Cited In (26)
- An Algebraic Approach to Refinement with Fair Choice
- Encoding fairness in a synchronous concurrent program algebra
- Categorical fixed point calculus
- A Relation-Algebraic Treatment of the Dedekind Recursion Theorem
- An algebraic hardware/software partitioning algorithm
- Algebraic notions of nontermination: Omega and divergence in idempotent semirings
- Kleene under a modal demonic star
- An algebra of hybrid systems
- Precise interprocedural dependence analysis of parallel programs
- Computing kernels in directed bichromatic graphs
- A calculational approach to mathematical induction
- The equational logic of fixed points
- Assertions and recursions
- Concurrent Kleene algebra and its foundations
- Algebras for iteration and infinite computations
- Datatype-generic termination proofs
- Normal design algebra
- Least reflexive points of relations
- Components and acyclicity of graphs. An exercise in combining precision with concision
- Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
- Title not available (Why is that?)
- Modal algebra and Petri nets
- Title not available (Why is that?)
- Dual unbounded nondeterminacy, recursion, and fixpoints
- Title not available (Why is that?)
- Games and winning strategies
This page was built for publication: Fixed-point calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674263)
