On the public citation graph
A stuttering closed temporal logic for modular reasoning about concurrent programs
0 signed · 36 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-56287-7_92openalex-snapshot
System specification and refinement in temporal logic
inferredcites →https://doi.org/10.1007/3-540-56496-9_27openalex-snapshot
Crocos: An integrated environment for interactive verification of SDL specifications
inferredcites →https://doi.org/10.1007/978-1-4471-3227-1_33openalex-snapshot
On using a Composition Principle to Design Parallel Programs
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf00289062openalex-snapshot
The ?Hoare logic? of concurrent programs
inferredcites →https://doi.org/10.1007/bf01700692openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1007/bfb0013019openalex-snapshot
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
inferredcites →https://doi.org/10.1007/bfb0014000openalex-snapshot
A stuttering closed temporal logic for modular reasoning about concurrent programs
inferredcites →https://doi.org/10.1007/s00605-006-0423-7openalex-snapshot
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
inferredcites →https://doi.org/10.1016/0304-3975(93)90151-iopenalex-snapshot
A logical view of composition
inferredcites →https://doi.org/10.1016/0304-3975(94)00206-xopenalex-snapshot
On using temporal logic for refinement and compositional verification of concurrent systems
inferredcites →https://doi.org/10.1016/0378-4754(83)90038-1openalex-snapshot
The correctness problem in computer science
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1988.5115openalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/63238.63240openalex-snapshot
A simple approach to specifying concurrent systems
inferredcites →https://doi.org/10.1145/69624.357207openalex-snapshot
Specifying Concurrent Program Modules
inferredcites →https://doi.org/10.1145/72981.73000openalex-snapshot
Predicates are predicate transformers: a unified compositional theory for concurrency
inferredcites →https://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications
inferredcites →https://doi.org/10.21236/ada116035openalex-snapshot
Verification of Concurrent Programs. Part II. Temporal Proof Principles.
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-60428-6_45openalex-snapshot
Multilevel refinement planning in an interval-based temporal logic
inferred← citeshttps://doi.org/10.1016/0169-023x(95)00039-uopenalex-snapshot
A basic calculus for verifying properties of interacting objects
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00206-xopenalex-snapshot
On using temporal logic for refinement and compositional verification of concurrent systems
inferred← citeshttps://doi.org/10.1109/time.2004.1314429openalex-snapshot
Compositional temporal logic based on partial order
inferred← citeshttps://doi.org/10.22028/d291-24967openalex-snapshot
Deduction-based refinement planning
inferred← citeshttps://doi.org/10.4018/978-1-93177-744-5.ch004openalex-snapshot
Specification of Business Components Using Temporal OCL
showing the first 10 of 11 · page through all 11
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.