On the public citation graph

Formal derivation of strongly correct concurrent programs

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-08921-7_96openalex-snapshot

Ensuring correctness by arbitrary postfixed-points

inferredcites →https://doi.org/10.1007/978-3-662-21545-6openalex-snapshot

Automata, Languages and Programming

inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot

An axiomatic proof technique for parallel programs I

inferredcites →https://doi.org/10.1007/bf00289074openalex-snapshot

A proof method for cyclic programs

inferredcites →https://doi.org/10.1007/bf00289519openalex-snapshot

Hierarchical ordering of sequential processes

inferredcites →https://doi.org/10.1007/bfb0022492openalex-snapshot

Formal description of programming concepts

inferredcites →https://doi.org/10.1007/bfb0032016openalex-snapshot

Automata, Languages and Programming

inferredcites →https://doi.org/10.1016/0020-0190(78)90082-0openalex-snapshot

A general mechanism for avoiding starvation with distributed control

inferredcites →https://doi.org/10.1090/psapm/019/0235771openalex-snapshot

Assigning meanings to programs

inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot

Proving the Correctness of Multiprocess Programs

inferredcites →https://doi.org/10.1145/1478873.1478997openalex-snapshot

A class of allocation strategies inducing bounded delays only

inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot

Formal verification of parallel programs

inferredcites →https://doi.org/10.1145/362452.362486openalex-snapshot

Comments on prevention of system deadlocks

inferredcites →https://doi.org/10.1145/390016.808454openalex-snapshot

Constructing correct and efficient concurrent programs

inferredcites →https://doi.org/10.21236/ada043450openalex-snapshot

Nondeterminism and the Correctness of Parallel Programs.

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-10001-6_25openalex-snapshot

Atomicity of activities

inferred← citeshttps://doi.org/10.1007/3-540-11157-3_30openalex-snapshot

The logical approach to programming

inferred← citeshttps://doi.org/10.1007/3-540-11494-7_16openalex-snapshot

Proving the correctness of implementations of shared data abstractions

inferred← citeshttps://doi.org/10.1007/3-540-11494-7_7openalex-snapshot

A weakest precondition semantics for communicating processes

inferred← citeshttps://doi.org/10.1007/3-540-51305-1_12openalex-snapshot

Stepwise refinement and concurrency: A small exercise

inferred← citeshttps://doi.org/10.1007/3-540-51305-1_7openalex-snapshot

Stepwise refinement of action systems

inferred← citeshttps://doi.org/10.1007/3-540-52513-0_8openalex-snapshot

A buffering system implementation using VDM

inferred← citeshttps://doi.org/10.1007/3-540-52592-0_62openalex-snapshot

Development of concurrent systems by incremental transformation

inferred← citeshttps://doi.org/10.1007/3-540-55160-3_55openalex-snapshot

Invariance and contraction by infinite iterations of relations

inferred← citeshttps://doi.org/10.1007/3-540-58843-4_20openalex-snapshot

Analysis of dynamical systems using predicate transformers: Attraction and composition

inferred← citeshttps://doi.org/10.1007/3-540-61474-5_79openalex-snapshot

Atomicity refinement and trace reduction theorems

inferred← citeshttps://doi.org/10.1007/978-3-540-39800-4_2openalex-snapshot

From System Goals to Software Architecture

inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_14openalex-snapshot

Iterative Synthesis of Control Guards Ensuring Invariance and Inevitability in Discrete-Decision Games

inferred← citeshttps://doi.org/10.1007/978-3-540-70594-9_18openalex-snapshot

Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_16openalex-snapshot

Understanding and Expressing Software Construction

inferred← citeshttps://doi.org/10.1007/978-3-642-84542-0_7openalex-snapshot

Extending the Techniques to Parallel Programs

inferred← citeshttps://doi.org/10.1007/978-94-009-7019-9_2openalex-snapshot

Issues in the Methodical Design of Concurrent Programs

inferred← citeshttps://doi.org/10.1007/bf00289237openalex-snapshot

An approach to automating the verification of compact parallel coordination programs. I

inferred← citeshttps://doi.org/10.1007/bf00871691openalex-snapshot

Towards a derivational style of distributed system design ? An example

inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot

Semantics of algorithmic languages

inferred← citeshttps://doi.org/10.1007/bf03037451openalex-snapshot

A functional style of programming with CSP-like communication mechanisms

inferred← citeshttps://doi.org/10.1007/bfb0039067openalex-snapshot

A programming logic for formal concurrent systems

inferred← citeshttps://doi.org/10.1016/0020-0190(86)90133-xopenalex-snapshot

A generalized deadlock predicate

inferred← citeshttps://doi.org/10.1016/0167-6423(82)90002-8openalex-snapshot

A methodology for programming with concurrency: An informal presentation

inferred← citeshttps://doi.org/10.1016/0167-6423(90)90020-eopenalex-snapshot

Stepwise refinement and concurrency: the finite-state case

inferred← citeshttps://doi.org/10.1016/0167-6423(93)90007-copenalex-snapshot

Concurrency without toil: a systematic method for parallel program design

inferred← citeshttps://doi.org/10.1016/0304-3975(84)90001-xopenalex-snapshot

A weakest precondition semantics for communicating processes

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/s1571-0661(05)82567-8openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1051/ita/1980140100571openalex-snapshot

Sur l'élimination itérative des situations de blocage dans un système

inferred← citeshttps://doi.org/10.1080/00207168108803275openalex-snapshot

Livelocks in parallel programs

inferred← citeshttps://doi.org/10.1109/kbse.1992.252925openalex-snapshot

Explorations on the formal frontier of distributed system design

inferred← citeshttps://doi.org/10.1109/tse.2014.2312954openalex-snapshot

Analyzing Critical Decision-Based Processes

inferred← citeshttps://doi.org/10.1109/tse.2014.2372785openalex-snapshot

The Oracle Problem in Software Testing: A Survey

inferred← citeshttps://doi.org/10.1137/0210016openalex-snapshot

The Total Correctness of Parallel Programs

inferred← citeshttps://doi.org/10.1145/1453101.1453133openalex-snapshot

Requirements engineering

inferred← citeshttps://doi.org/10.1145/322609.322790openalex-snapshot

How to relieve a programmer from synchronization details

inferred← citeshttps://doi.org/10.1145/336512.336546openalex-snapshot

Formal specification

inferred← citeshttps://doi.org/10.1145/857076.857079openalex-snapshot

Requirements interaction management

inferred← citeshttps://doi.org/10.4067/s0718-33052014000200010openalex-snapshot

La especificación formal en contexto: actual y futuro

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.