On the public citation graph

Separation and Reduction

https://doi.org/10.1007/10722010_4
0 signed · 119 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1994.1037openalex-snapshot
A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events
inferredcites →https://doi.org/10.1007/3-540-51285-3_42openalex-snapshot
A method for refining atomicity in parallel algorithms
inferredcites →https://doi.org/10.1007/bf01786631openalex-snapshot
A theorem on atomicity in distributed algorithms
inferredcites →https://doi.org/10.1007/s002360050163openalex-snapshot
Reasoning algebraically about loops
inferredcites →https://doi.org/10.1109/tcom.1984.1095950openalex-snapshot
Protocol Validation by Maximal Progress State Exploration
inferredcites →https://doi.org/10.1145/158511.158524openalex-snapshot
Imperative functional programming
inferredcites →https://doi.org/10.1145/361227.361234openalex-snapshot
Reduction
inferredcites →https://doi.org/10.1145/512950.512965openalex-snapshot
Parallel program correctness through refinement
inferredcites →https://doi.org/10.2307/3562647openalex-snapshot
RESEARCH NOTES

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_49openalex-snapshot
Termination in Modal Kleene Algebra
inferred← citeshttps://doi.org/10.1007/11591191_37openalex-snapshot
Towards Automated Proof Support for Probabilistic Distributed Systems
inferred← citeshttps://doi.org/10.1007/11734673_10openalex-snapshot
Towards an Algebra of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/11734673_15openalex-snapshot
Verification of Pushdown Systems Using Omega Algebra with Domain
inferred← citeshttps://doi.org/10.1007/11734673_16openalex-snapshot
wp Is wlp
inferred← citeshttps://doi.org/10.1007/11734673_5openalex-snapshot
Static Analysis of Programs Using Omega Algebra with Tests
inferred← citeshttps://doi.org/10.1007/11768173_14openalex-snapshot
Modal Design Algebra
inferred← citeshttps://doi.org/10.1007/11783596_19openalex-snapshot
Continuous Action System Refinement
inferred← citeshttps://doi.org/10.1007/11783596_23openalex-snapshot
Refinement Algebra with Operators for Enabledness and Termination
inferred← citeshttps://doi.org/10.1007/11784180_21openalex-snapshot
Quantales and Temporal Logics
inferred← citeshttps://doi.org/10.1007/11828563_15openalex-snapshot
Omega Algebra, Demonic Refinement Algebra and Commands
inferred← citeshttps://doi.org/10.1007/11828563_20openalex-snapshot
Using Probabilistic Kleene Algebra for Protocol Verification
inferred← citeshttps://doi.org/10.1007/11828563_8openalex-snapshot
Demonic Algebra with Domain
inferred← citeshttps://doi.org/10.1007/11901433_21openalex-snapshot
Reasoning Algebraically About Probabilistic Loops
inferred← citeshttps://doi.org/10.1007/3-540-36280-0_19openalex-snapshot
Calculating Church-Rosser Proofs in Kleene Algebra
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_36openalex-snapshot
Optimistic Synchronization-Based State-Space Reduction
inferred← citeshttps://doi.org/10.1007/3-540-45442-x_14openalex-snapshot
From Kleene Algebra to Refinement Algebra
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_1openalex-snapshot
Wanted: a compositional approach to concurrency
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_3openalex-snapshot
Asynchronous progress
inferred← citeshttps://doi.org/10.1007/978-3-030-02450-5_1openalex-snapshot
Engineering a Theory of Concurrent Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-31038-7_4openalex-snapshot
Connecting Fixpoints of Computations with Strict Progress
inferred← citeshttps://doi.org/10.1007/978-3-030-31038-7_9openalex-snapshot
Developing an Algebra for Rely/Guarantee Concurrency: Design Decisions and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-030-81701-5_3openalex-snapshot
Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-030-88701-8_21openalex-snapshot
Computing Least and Greatest Fixed Points in Absorptive Semirings
inferred← citeshttps://doi.org/10.1007/978-3-031-88930-1_2openalex-snapshot
Some Uses of Modal Semirings
inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_24openalex-snapshot
Cyclic System for an Algebraic Theory of Alternating Parity Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_4openalex-snapshot
Algebras for Program Correctness in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_9openalex-snapshot
Extended Conscriptions Algebraically
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_23openalex-snapshot
Invariants, Well-Founded Statements and Real-Time Program Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-24704-5_13openalex-snapshot
Encoding and Decoding in Refinement Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_9openalex-snapshot
Pointer Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-27764-4_14openalex-snapshot
Lazy Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-27815-3_30openalex-snapshot
Modal Kleene Algebra and Partial Correctness
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_9openalex-snapshot
Proofs and Refutations for Probabilistic Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_19openalex-snapshot
Automated Reasoning in Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_10openalex-snapshot
A Non-probabilistic Relational Model of Probabilistic Kleene Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_16openalex-snapshot
Non-termination in Idempotent Semirings
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_24openalex-snapshot
Knowledge and Games in Modal Semirings
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_6openalex-snapshot
Latest News about Demonic Algebra with Domain
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_7openalex-snapshot
On the Structure of Demonic Refinement Algebras with Enabledness and Termination
inferred← citeshttps://doi.org/10.1007/978-3-540-87873-5_19openalex-snapshot
Formal Functional Verification of Device Drivers
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_27openalex-snapshot
Concurrent Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1openalex-snapshot
Relations and Kleene Algebra in Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_11openalex-snapshot
General Correctness Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_12openalex-snapshot
Foundations of Concurrent Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_22openalex-snapshot
A While Program Normal Form Theorem in Total Correctness
inferred← citeshttps://doi.org/10.1007/978-3-642-13321-3_11openalex-snapshot
Partial, Total and General Correctness
inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_5openalex-snapshot
Reasoning about Loops in Total and General Correctness
inferred← citeshttps://doi.org/10.1007/978-3-642-14808-8_1openalex-snapshot
Invariants and Well-Foundedness in Program Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-16690-7_10openalex-snapshot
Unifying Recursion in Partial, Total and General Correctness
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_1openalex-snapshot
Building Structured Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_16openalex-snapshot
Towards a Typed Omega Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_19openalex-snapshot
Omega Algebras and Regular Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_5openalex-snapshot
Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_41openalex-snapshot
Automating Algebraic Methods in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-31113-0_11openalex-snapshot
Unifying Correctness Statements
inferred← citeshttps://doi.org/10.1007/978-3-642-33296-8_14openalex-snapshot
Verification Rules for Exception Handling in Eiffel
inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_12openalex-snapshot
On Completeness of Omega-Regular Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-33314-9_2openalex-snapshot
Unifying Lazy and Strict Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-38613-8_26openalex-snapshot
Structural Transformations for Data-Enriched Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_16openalex-snapshot
Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/s00165-009-0111-1openalex-snapshot
Refinement algebra for probabilistic programs
inferred← citeshttps://doi.org/10.1007/s00165-012-0231-xopenalex-snapshot
Layered reasoning for randomized distributed algorithms
inferred← citeshttps://doi.org/10.1007/s00165-014-0306-yopenalex-snapshot
Structural transformations for data-enriched real-time systems
inferred← citeshttps://doi.org/10.1007/s00236-008-0073-4openalex-snapshot
Algebraic reasoning for probabilistic action systems and while-loops
inferred← citeshttps://doi.org/10.1007/s00236-012-0162-2openalex-snapshot
Algebras for iteration and infinite computations
inferred← citeshttps://doi.org/10.1007/s10703-006-0003-4openalex-snapshot
Optimistic synchronization-based state-space reduction
inferred← citeshttps://doi.org/10.1007/s11225-012-9416-9openalex-snapshot
Dual Choice and Iteration in an Abstract Algebra of Action
inferred← citeshttps://doi.org/10.1007/s12046-009-0004-2openalex-snapshot
Proving the correctness of client/server software
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.049openalex-snapshot
Diagram Chase in Relational System Development
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.005openalex-snapshot
Modal Tools for Separation and Refinement
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.08.001openalex-snapshot
Infinite executions of lazy and strict computations
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.10.002openalex-snapshot
Completeness results for omega-regular algebras
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.11.009openalex-snapshot
An algebraic approach to computations with progress
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.04.001openalex-snapshot
Abstract abstract reduction
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.04.006openalex-snapshot
Kleene under a modal demonic star
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.10.004openalex-snapshot
Algebraic Neighbourhood Logic
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.10.005openalex-snapshot
Using probabilistic Kleene algebra pKA for protocol verification
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.08.005openalex-snapshot
An algebra of hybrid systems
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.07.002openalex-snapshot
Normal design algebra
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.014openalex-snapshot
Abstract representation theorems for demonic refinement algebras
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.016openalex-snapshot
Algebraic notions of nontermination: Omega and divergence in idempotent semirings
inferred← citeshttps://doi.org/10.1016/j.jlap.2011.04.004openalex-snapshot
Fixpoints for general correctness
inferred← citeshttps://doi.org/10.1016/j.jlap.2011.04.005openalex-snapshot
Concurrent Kleene Algebra and its Foundations
inferred← citeshttps://doi.org/10.1016/j.jlap.2011.04.008openalex-snapshot
Normal forms in total correctness for while programs and action systems
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.05.002openalex-snapshot
Typing theorems of omega algebra
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.05.004openalex-snapshot
Left omega algebras and regular equations
inferred← citeshttps://doi.org/10.1016/j.scico.2003.09.002openalex-snapshot
Towards a refinement algebra
inferred← citeshttps://doi.org/10.1016/j.scico.2006.01.010openalex-snapshot
Kleene getting lazy
inferred← citeshttps://doi.org/10.1016/j.scico.2007.11.004openalex-snapshot
Enabledness and termination in refinement algebra
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.009openalex-snapshot
Extended designs algebraically
inferred← citeshttps://doi.org/10.1016/j.scico.2013.08.008openalex-snapshot
Algebras for correctness of sequential computations
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.069openalex-snapshot
Algebras of modal operators and partial correctness
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.018openalex-snapshot
Fixing Zeno gaps
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80967-8openalex-snapshot
A Generalisation of Stationary Distributions, and Probabilistic Program Algebra
inferred← citeshttps://doi.org/10.1093/comjnl/bxs140openalex-snapshot
Modal Knowledge and Game Semirings
inferred← citeshttps://doi.org/10.1109/iceccs.2007.39openalex-snapshot
Reasoning about Nonblocking Concurrency using Reduction
inferred← citeshttps://doi.org/10.1109/tase.2009.53openalex-snapshot
Refinement Algebra with Explicit Probabilism
inferred← citeshttps://doi.org/10.1145/1166109.1166116openalex-snapshot
Kleene algebra with domain
inferred← citeshttps://doi.org/10.1145/1183278.1183285openalex-snapshot
Kleene algebra with domain
inferred← citeshttps://doi.org/10.1145/3450272openalex-snapshot
Polymorphic Iterable Sequential Effect Systems
inferred← citeshttps://doi.org/10.1145/3571213openalex-snapshot
An Algebra of Alignment for Relational Verification
inferred← citeshttps://doi.org/10.1145/3661814.3662138openalex-snapshot
A proof theory of right-linear (ω-)grammars via cyclic proofs
inferred← citeshttps://doi.org/10.1145/3704896openalex-snapshot
A Taxonomy of Hoare-Like Logics: Towards a Holistic View using Predicate Transformers and Kleene Algebras with Top and Tests
inferred← citeshttps://doi.org/10.18725/oparu-895openalex-snapshot
Algebraic foundations of the Unifying Theories of Programming
inferred← citeshttps://doi.org/10.2168/lmcs-7(1:1)2011openalex-snapshot
Algebraic Notions of Termination
inferred← citeshttps://doi.org/10.25949/19430699openalex-snapshot
Algebraic verification of probabilistic and concurrent systems
inferred← citeshttps://doi.org/10.3217/jucs-015-01-0072openalex-snapshot
Reasoning about Nonblocking Concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.1403.4074openalex-snapshot
Hypothesis Elimination in Kleene Semirings
inferred← citeshttps://doi.org/10.5109/1495413openalex-snapshot
PROBABILISTIC RELATIONAL MODELS OF COMPLETE IL-SEMIRINGS
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.