On the public citation graph

Semantics of nondeterministic and noncontinuous constructs

https://doi.org/10.1007/bfb0014683
0 signed · 72 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.1007/3-540-08353-7_141openalex-snapshot
Semantics of infinite processes using generalized trees
inferredcites →https://doi.org/10.1007/3-540-08442-8_65openalex-snapshot
Non deterministic recursive program schemes
inferredcites →https://doi.org/10.1007/978-1-4613-8168-6openalex-snapshot
Introduction to Axiomatic Set Theory
inferredcites →https://doi.org/10.1007/978-3-662-38452-7_12openalex-snapshot
Die logischen Grundlagen der Mathematik
inferredcites →https://doi.org/10.1007/978-3-662-58029-5openalex-snapshot
Einführung in die mathematische Logik
inferredcites →https://doi.org/10.1007/978-3-663-16102-8_1openalex-snapshot
Die Grundlagen der Mathematik
inferredcites →https://doi.org/10.1007/978-94-010-3144-8openalex-snapshot
Introduction to Axiomatic Set Theory
inferredcites →https://doi.org/10.1007/bf01445300openalex-snapshot
Beweis, da� jede Menge wohlgeordnet werden kann
inferredcites →https://doi.org/10.1007/bf01448445openalex-snapshot
Die logischen Grundlagen der Mathematik
inferredcites →https://doi.org/10.1007/bfb0014674openalex-snapshot
A study on transformational semantics
inferredcites →https://doi.org/10.1007/bfb0014676openalex-snapshot
Examples for change of types and object structures
inferredcites →https://doi.org/10.1007/bfb0073961openalex-snapshot
Toposes, Algebraic Geometry and Logic
inferredcites →https://doi.org/10.1016/0022-0000(78)90048-xopenalex-snapshot
Power domains
inferredcites →https://doi.org/10.1016/s0049-237x(08)71948-7openalex-snapshot
Processes: A Mathematical Model of Computing Agents
inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot
A Basis for a Mathematical Theory of Computation )
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7102-2openalex-snapshot
Computer Programming and Formal Systems
inferredcites →https://doi.org/10.1109/tse.1975.6312816openalex-snapshot
Specification techniques for data abstractions
inferredcites →https://doi.org/10.1112/jlms/s1-43.1.568aopenalex-snapshot
ÉLÉMENTS DE LOGIQUE MATHÉMATIQUE
inferredcites →https://doi.org/10.1137/0205035openalex-snapshot
A Powerdomain Construction
inferredcites →https://doi.org/10.1145/321420.321422openalex-snapshot
Nondeterministic Algorithms
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/390016.808426openalex-snapshot
Specification techniques for data abstractions
inferredcites →https://doi.org/10.1145/954587.954588openalex-snapshot
Towards a wide spectrum language to support program specification and program development
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
inferredcites →https://doi.org/10.2307/2218270openalex-snapshot
Computer Programming and Formal Systems.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11734673_16openalex-snapshot
wp Is wlp
inferred← citeshttps://doi.org/10.1007/11734673_9openalex-snapshot
Non-termination in Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1007/11768173_14openalex-snapshot
Modal Design Algebra
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_5openalex-snapshot
On relations between programs
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_61openalex-snapshot
On the algebraic specification of nondeterministic programming languages
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_38openalex-snapshot
A cook's tour of countable nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_211openalex-snapshot
Generated models and the ω-rule: The nondeterministic case
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-319-15545-6_1openalex-snapshot
A Homage to Martin Wirsing
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_7openalex-snapshot
Logical Relations and Nondeterminism
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_12openalex-snapshot
Lazy Relations
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-13321-3_11openalex-snapshot
Partial, Total and General Correctness
inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_6openalex-snapshot
Lazy UTP
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-31113-0_11openalex-snapshot
Unifying Correctness Statements
inferred← citeshttps://doi.org/10.1007/978-94-009-7893-5_14openalex-snapshot
Behaviors of Processes and Synchronized Systems of Processes
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf01418755openalex-snapshot
Nondeterministic three-valued logic: Isotonic and guarded truth-functions
inferred← citeshttps://doi.org/10.1007/bf03037451openalex-snapshot
A functional style of programming with CSP-like communication mechanisms
inferred← citeshttps://doi.org/10.1007/bfb0014672openalex-snapshot
Systematics of transformation rules
inferred← citeshttps://doi.org/10.1007/bfb0014674openalex-snapshot
A study on transformational semantics
inferred← citeshttps://doi.org/10.1007/s00012-021-00719-4openalex-snapshot
Axioms for signatures with domain and demonic composition
inferred← citeshttps://doi.org/10.1007/s00236-012-0162-2openalex-snapshot
Algebras for iteration and infinite computations
inferred← citeshttps://doi.org/10.1007/s11191-008-9147-5openalex-snapshot
The Concept of Nondeterminism: Its Development and Implications for Teaching
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90005-2openalex-snapshot
On correct refinement of programs
inferred← citeshttps://doi.org/10.1016/0167-6423(81)90006-xopenalex-snapshot
Programming in a wide spectrum language: a collection of examples
inferred← citeshttps://doi.org/10.1016/0167-6423(87)90008-6openalex-snapshot
A simple calculus for program transformation (inclusive of induction)
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90055-5openalex-snapshot
A continuous semantics for unbounded nondeterminism
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90040-xopenalex-snapshot
A theory for nondeterminism, parallelism, communication, and concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90172-6openalex-snapshot
Relational algebraic semantics of deterministic and nondeterministic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00082-8openalex-snapshot
Relation-algebraic semantics
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.11.002openalex-snapshot
Domain and range for angelic and demonic compositions
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.015openalex-snapshot
Imperative abstractions for functional actions
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.009openalex-snapshot
Extended designs algebraically
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00313-3openalex-snapshot
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80168-9openalex-snapshot
Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation (Extended Abstract)
inferred← citeshttps://doi.org/10.1070/rm1996v051n03abeh002913openalex-snapshot
Recursively separable enumerated algebras
inferred← citeshttps://doi.org/10.1109/32.21743openalex-snapshot
Formal program construction by transformations-computer-aided, intuition-guided programming
inferred← citeshttps://doi.org/10.1109/hol.1991.596289openalex-snapshot
Proof Of Program Transformations
inferred← citeshttps://doi.org/10.1111/j.1467-8659.1982.tb00035.xopenalex-snapshot
Relying on abstraction to facilitate graphics programming
inferred← citeshttps://doi.org/10.1145/1595453.1595495openalex-snapshot
The concept of nondeterminism
inferred← citeshttps://doi.org/10.1145/248621.248623openalex-snapshot
Algebraic approaches to nondeterminism—an overview
inferred← citeshttps://doi.org/10.1145/3797874openalex-snapshot
Denotation-based Compositional Compiler Verification
inferred← citeshttps://doi.org/10.18725/oparu-895openalex-snapshot
Algebraic foundations of the Unifying Theories of Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1811.01712openalex-snapshot
Domain and range for angelic and demonic compositions
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.