On the public citation graph
Modal logic of concurrent nondeterministic programs
0 signed · 47 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/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot
Assigning meanings to programs
inferredcites →https://doi.org/10.1109/sfcs.1976.27openalex-snapshot
Semantical consideration on floyo-hoare logic
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/359340.359353openalex-snapshot
Is “sometime” sometimes better than “always”?
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1145/512760.512782openalex-snapshot
Nondeterminism in logics of programs
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1145/800105.803418openalex-snapshot
Propositional modal logic of programs
inferredcites →https://doi.org/10.1145/800133.804362openalex-snapshot
A practical decision method for propositional dynamic logic (Preliminary Report)
inferredcites →https://doi.org/10.2307/2273958openalex-snapshot
Vaughan R. Pratt. Semantical considerations on Floyd–Hoare logic. 17th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, New York1976, pp. 109–121. - Michael J. Fischer and Richard E. Ladner. Propositional dynamic logic of regular programs.…
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.1997.2680openalex-snapshot
Proving Properties of Dynamic Process Networks
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_90openalex-snapshot
A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_22openalex-snapshot
Laws of Parallel Synchronised Termination
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_37openalex-snapshot
Tableaux Methods for Propositional Dynamic Logics with Separating Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_26openalex-snapshot
Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_10openalex-snapshot
Exponential-Size Model Property for PDL with Separating Parallel Composition
inferred← citeshttps://doi.org/10.1007/bf00265555openalex-snapshot
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
inferred← citeshttps://doi.org/10.1007/bf00286492openalex-snapshot
Descriptively complete process logic
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf01257083openalex-snapshot
The temporal logic of branching time
inferred← citeshttps://doi.org/10.1007/bfb0022540openalex-snapshot
Decision complexity of variants of propositional dynamic logic
inferred← citeshttps://doi.org/10.1007/bfb0030311openalex-snapshot
The power of the future perfect in program logics
inferred← citeshttps://doi.org/10.1007/bfb0039699openalex-snapshot
A compositional semantics of combining forms for gamma programs
inferred← citeshttps://doi.org/10.1007/s001650200032openalex-snapshot
A Refinement Calculus for Shared-Variable Parallel and Distributed Programming
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90124-7openalex-snapshot
The equational theory of pomsets
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90151-iopenalex-snapshot
A logical view of composition
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90347-vopenalex-snapshot
∏11-universality of some propositional logics of concurrent programs
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90005-mopenalex-snapshot
Towards a foundation for semantics in complete metric spaces
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.009openalex-snapshot
Synchronous Kleene algebra
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80025-5openalex-snapshot
The power of the future perfect in program logics
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00151-5openalex-snapshot
Refining multiset transformers
inferred← citeshttps://doi.org/10.1080/09528139408953788openalex-snapshot
A deductive clustering approach
inferred← citeshttps://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferred← citeshttps://doi.org/10.1109/sfcs.1982.57openalex-snapshot
A temporal logic to deal with fairness in transition systems
inferred← citeshttps://doi.org/10.1109/time.1997.600795openalex-snapshot
BCTL: a branching clock temporal logic
inferred← citeshttps://doi.org/10.1145/1480881.1480887openalex-snapshot
A model of cooperative threads
inferred← citeshttps://doi.org/10.1145/567532.567551openalex-snapshot
The temporal logic of branching time
inferred← citeshttps://doi.org/10.1145/582153.582177openalex-snapshot
On the composition of processes
inferred← citeshttps://doi.org/10.1145/99583.99626openalex-snapshot
A logical view of composition and refinement
inferred← citeshttps://doi.org/10.20868/upm.thesis.46778openalex-snapshot
Síntesis de protocolos de comunicación a partir de especificaciones de servicio
inferred← citeshttps://doi.org/10.2977/prims/1195184022openalex-snapshot
Prepositional Dynamic Logic for Concurrent Programs
inferred← citeshttps://doi.org/10.5445/ir/1000039446openalex-snapshot
Towards Specification and Verification of Information Flow in Concurrent Java-like Programs
inferred← citeshttps://doi.org/10.5445/ir/1000045641openalex-snapshot
Deductive Verification of Concurrent Programs
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.