On the public citation graph

General correctness: A unification of partial and total correctness

https://doi.org/10.1007/bf00290146
0 signed · 55 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-07854-1_217openalex-snapshot
DIJKSTRA's predicate transformer, non-determinism, recursion, and termination
inferredcites →https://doi.org/10.1007/3-540-10003-2_59openalex-snapshot
Semantics of unbounded nondeterminism
inferredcites →https://doi.org/10.1007/3-540-11494-7_12openalex-snapshot
Another characterization of weakest preconditions
inferredcites →https://doi.org/10.1007/978-1-4612-5983-1openalex-snapshot
The Science of Programming
inferredcites →https://doi.org/10.1007/bf00264034openalex-snapshot
Consistent and complementary formal theories of the semantics of programming languages
inferredcites →https://doi.org/10.1007/bf00264250openalex-snapshot
A logic covering undefinedness in program proofs
inferredcites →https://doi.org/10.1007/bfb0022492openalex-snapshot
Formal description of programming concepts
inferredcites →https://doi.org/10.1016/0020-0190(80)90048-4openalex-snapshot
A simple relation between relational and predicate transformer semantics for nondeterministic programs
inferredcites →https://doi.org/10.1016/0022-0000(78)90048-xopenalex-snapshot
Power domains
inferredcites →https://doi.org/10.1016/0304-3975(81)90038-4openalex-snapshot
On the total correctness of nondeterministic programs
inferredcites →https://doi.org/10.1016/s0022-0000(77)80006-8openalex-snapshot
A characterization of weakest preconditions
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/321958.321967openalex-snapshot
Scheduling Tasks with Nonuniform Deadlines on Two Processors
inferredcites →https://doi.org/10.1145/322077.322088openalex-snapshot
Some Properties of Predicate Transformers
inferredcites →https://doi.org/10.1145/69610.357988openalex-snapshot
Predicative programming Part I

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44525-0_23openalex-snapshot
An Execution Architecture for GSL
inferred← citeshttps://doi.org/10.1007/978-3-030-02149-8_16openalex-snapshot
False Failure: Creating Failure Models for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_12openalex-snapshot
Lifting General Correctness into Partial Correctness is ok
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-13321-3_12openalex-snapshot
Unifying Theories of Programming That Distinguish Nontermination and Abort
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-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/bf00259469openalex-snapshot
Duality in specification languages: a lattice-theoretical approach
inferred← citeshttps://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferred← citeshttps://doi.org/10.1007/bf01211604openalex-snapshot
Predicate transformers as power operations
inferred← citeshttps://doi.org/10.1007/bf01530788openalex-snapshot
Towards reasoning about Hoare relations
inferred← citeshttps://doi.org/10.1007/pl00003923openalex-snapshot
Unification of Four Versions of Program Semantics
inferred← citeshttps://doi.org/10.1007/s00236-007-0049-9openalex-snapshot
Dual unbounded nondeterminacy, recursion, and fixpoints
inferred← citeshttps://doi.org/10.1007/s00236-012-0162-2openalex-snapshot
Algebras for iteration and infinite computations
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90309-4openalex-snapshot
Combining angels, demons and miracles in program specifications
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.12.004openalex-snapshot
Formalising General Correctness
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.016openalex-snapshot
Of wlp and CSP
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.jlap.2011.04.004openalex-snapshot
Fixpoints for general correctness
inferred← citeshttps://doi.org/10.1016/j.jlap.2014.02.008openalex-snapshot
Multirelations with infinite computations
inferred← citeshttps://doi.org/10.1016/j.scico.2006.01.008openalex-snapshot
Terms with unbounded demonic and angelic nondeterminacy
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.009openalex-snapshot
Extended designs algebraically
inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.010openalex-snapshot
Linking Unifying Theories of Program refinement
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(04)80881-8openalex-snapshot
Abstract Commands:
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.1016/s1571-0661(05)80480-3openalex-snapshot
Junctive Compositions of Specifications in Total and General Correctness
inferred← citeshttps://doi.org/10.1109/tpds.2005.58openalex-snapshot
A theory for deadlock-free dynamic network reconfiguration. Part I
inferred← citeshttps://doi.org/10.1145/1292597.1292600openalex-snapshot
Compound monads in specification languages
inferred← citeshttps://doi.org/10.1145/1391956.1391961openalex-snapshot
Dually nondeterministic functions
inferred← citeshttps://doi.org/10.1145/3527331openalex-snapshot
Quantitative strongest post: a calculus for reasoning about the flow of quantitative information
inferred← citeshttps://doi.org/10.14236/ewic/iwfm2001.1openalex-snapshot
Recasting Hoare and He’s Unifying Theory of Programs in the Context of General Correctness
inferred← citeshttps://doi.org/10.14236/ewic/nfm1998.8openalex-snapshot
Specification and Refinement in General Correctness
inferred← citeshttps://doi.org/10.22405/2226-8383-2025-26-3-113-124openalex-snapshot
Логика Хоара для императивного языка, учитывающего некоторые аппаратные ограничения
inferred← citeshttps://doi.org/10.2307/2275127openalex-snapshot
European summer meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.4204/eptcs.115.1openalex-snapshot
On a New Notion of Partial Refinement
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.