On the public citation graph
Duality in specification languages: a lattice-theoretical approach
0 signed · 62 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-10007-5_47openalex-snapshot
On the semantics of fair parallelism
inferredcites →https://doi.org/10.1007/bf00268074openalex-snapshot
A simple fixpoint argument without the restriction to continuity
inferredcites →https://doi.org/10.1007/bf00289091openalex-snapshot
do considered od: A contribution to the programming calculus
inferredcites →https://doi.org/10.1007/bf00290146openalex-snapshot
General correctness: A unification of partial and total correctness
inferredcites →https://doi.org/10.1007/bf00291051openalex-snapshot
A calculus of refinements for program derivations
inferredcites →https://doi.org/10.1016/0020-0190(88)90147-0openalex-snapshot
Data refinement by miracles
inferredcites →https://doi.org/10.1016/0167-6423(87)90011-6openalex-snapshot
A theoretical basis for stepwise refinement and the programming calculus
inferredcites →https://doi.org/10.1016/0304-3975(86)90040-xopenalex-snapshot
A theory for nondeterminism, parallelism, communication, and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(91)90029-2openalex-snapshot
Data refinement of predicate transformers
inferredcites →https://doi.org/10.1090/s0002-9904-1950-09392-6openalex-snapshot
Book Review: Lattice theory
inferredcites →https://doi.org/10.1109/hicss.1989.47997openalex-snapshot
Changing data representation in the refinement calculus
inferredcites →https://doi.org/10.1145/69558.69559openalex-snapshot
A generalization of Dijkstra's calculus
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1999.2820openalex-snapshot
Contracts, Games and Refinement
inferred← citeshttps://doi.org/10.1007/11828563_25openalex-snapshot
On Two Dually Nondeterministic Refinement Algebras
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_12openalex-snapshot
Compilation and Synthesis for Real-Time Embedded Controllers
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_60openalex-snapshot
Refinement calculus, part I: Sequential nondeterministic programs
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_24openalex-snapshot
ImpUNITY: UNITY with procedures and local variables
inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_2openalex-snapshot
Enforcing behavior with contracts
inferred← citeshttps://doi.org/10.1007/978-1-4471-3550-0_10openalex-snapshot
Constructive Refinement of First Order Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_11openalex-snapshot
A Tour Through the Programming Choices: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-25032-3_10openalex-snapshot
Algebra of Monotonic Boolean Transformers
inferred← citeshttps://doi.org/10.1007/978-3-662-02880-3_2openalex-snapshot
Refinement Calculus, Lattices and Higher Order Logic
inferred← citeshttps://doi.org/10.1007/bf01211214openalex-snapshot
DUALITY: A simple formalism for the analysis of UNITY
inferred← citeshttps://doi.org/10.1007/bfb0015457openalex-snapshot
On object-oriented design and verification
inferred← citeshttps://doi.org/10.1007/bfb0024644openalex-snapshot
Algorithm refinement with read and write frames
inferred← citeshttps://doi.org/10.1007/bfb0029960openalex-snapshot
Specifying computations using hyper transition systems
inferred← citeshttps://doi.org/10.1007/bfb0105413openalex-snapshot
Using lattice theory in higher order logic
inferred← citeshttps://doi.org/10.1007/s00165-006-0001-8openalex-snapshot
Angelic nondeterminism in the unifying theories of programming
inferred← citeshttps://doi.org/10.1007/s001659970002openalex-snapshot
Predicate Transformers for Recursive Procedures with Local Variables
inferred← citeshttps://doi.org/10.1007/s00236-003-0113-zopenalex-snapshot
Reasoning about probabilistic sequential programs in a probabilistic logic
inferred← citeshttps://doi.org/10.1007/s00236-007-0049-9openalex-snapshot
Dual unbounded nondeterminacy, recursion, and fixpoints
inferred← citeshttps://doi.org/10.1007/s002360000046openalex-snapshot
Demonic, angelic and unbounded probabilistic choices in sequential programs
inferred← citeshttps://doi.org/10.1007/s002360050115openalex-snapshot
Data refinement of mixed specifications
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90141-4openalex-snapshot
Program inversion in the refinement calculus
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00206-eopenalex-snapshot
Games and winning strategies
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90015-hopenalex-snapshot
Statement inversion and strongest postcondition
inferred← citeshttps://doi.org/10.1016/0304-3975(92)00016-kopenalex-snapshot
Nondeterminacy and recursion via stacks and games
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-89880-7.50026-7openalex-snapshot
Mechanising some Advanced Refinement Concepts
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.024openalex-snapshot
Angelic Nondeterminism and Unifying Theories of Programming
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.2013.07.002openalex-snapshot
Refinement algebra with dual operator
inferred← citeshttps://doi.org/10.1016/j.scico.2013.08.008openalex-snapshot
Algebras for correctness of sequential computations
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80725-xopenalex-snapshot
Soundness of a purely syntactical formalization of weakest preconditions
inferred← citeshttps://doi.org/10.1037/0000114-016openalex-snapshot
Where are we now, and where do we go from here?
inferred← citeshttps://doi.org/10.1109/apsec.2003.1254370openalex-snapshot
Implementing angelic nondeterminism
inferred← citeshttps://doi.org/10.1145/1391956.1391961openalex-snapshot
Dually nondeterministic functions
inferred← citeshttps://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferred← citeshttps://doi.org/10.1145/248621.248623openalex-snapshot
Algebraic approaches to nondeterminism—an overview
inferred← citeshttps://doi.org/10.1145/3371070openalex-snapshot
Deductive verification with ghost monitors
inferred← citeshttps://doi.org/10.14236/ewic/rw1996.1openalex-snapshot
Interpreting Nondeterminism in the Refinement Calculus
inferred← citeshttps://doi.org/10.2168/lmcs-12(3:6)2016openalex-snapshot
Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism
inferred← citeshttps://doi.org/10.4236/am.2016.75039openalex-snapshot
Fuzzy Semantics of Contract Language
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.