On the public citation graph

Compositionality and concurrent networks: Soundness and completeness of a proofsystem

https://doi.org/10.1007/bfb0015776
0 signed · 80 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-12896-4_384openalex-snapshot
A proof system for partial correctness of dynamic networks of processes
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_14openalex-snapshot
Specification-Oriented Programming in TCSP
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/bfb0036937openalex-snapshot
Specification-oriented semantics for communicating processes
inferredcites →https://doi.org/10.1016/0304-3975(84)90022-7openalex-snapshot
A linear-history semantics for languages for distributed programming
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1145/322108.322121openalex-snapshot
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/4472.4473openalex-snapshot
The denotational semantics of dynamic networks of processes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722167_14openalex-snapshot
On the Completeness of Compositional Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_26openalex-snapshot
A proof system for Distributed Processes
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/3-540-17179-7_20openalex-snapshot
On proving communication closedness of distributed layers
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_18openalex-snapshot
A compositional proof theory for real-time distributed message passing
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_7openalex-snapshot
Semantics for nondeterministic asynchronous broadcast networks
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_1openalex-snapshot
The Need for Compositional Proof Systems: A Survey
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_55openalex-snapshot
Compositionality in the temporal logic of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_56openalex-snapshot
A temporal-logic based compositional proof system for real-time message passing
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_59openalex-snapshot
Correctness of concurrent processes
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_80openalex-snapshot
From trace specifications to process terms
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_81openalex-snapshot
Some comments on the assumption-commitment framework for compositional verification of distributed programs
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_127openalex-snapshot
Program composition and modular verification
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_113openalex-snapshot
Program composition via unification
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_30openalex-snapshot
Partial order based design of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_72openalex-snapshot
A proof system for asynchronously communicating deterministic processes
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_42openalex-snapshot
Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_109openalex-snapshot
Modular completeness: Integrating the reuse of specified software in top-down program development
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_97openalex-snapshot
Local nondeterminism in asynchronously communicating processes
inferred← citeshttps://doi.org/10.1007/978-0-387-35562-7_4openalex-snapshot
Reasoning About Histories in Object-Based Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_15openalex-snapshot
A Compositional Axiomatisation of Safety and Liveness Properties for Statecharts
inferred← citeshttps://doi.org/10.1007/978-1-4615-4016-8_7openalex-snapshot
Concepts and Models for Real-Time Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_6openalex-snapshot
Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-06880-0_8openalex-snapshot
Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_1openalex-snapshot
A Bibliography of Willem-Paul de Roever
inferred← citeshttps://doi.org/10.1007/978-3-642-77572-7_15openalex-snapshot
Systematic Derivation of Communicating Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-77580-2_5openalex-snapshot
An introduction to compositional methods for concurrency and their application to real-time
inferred← citeshttps://doi.org/10.1007/bf00268075openalex-snapshot
Specification-oriented semantics for Communicating Processes
inferred← citeshttps://doi.org/10.1007/bf00283331openalex-snapshot
A proof system for distributed processes
inferred← citeshttps://doi.org/10.1007/bf01178381openalex-snapshot
Invariants, composition, and substitution
inferred← citeshttps://doi.org/10.1007/bf01215408openalex-snapshot
Reasoning about dynamically evolving process structures
inferred← citeshttps://doi.org/10.1007/bf01887214openalex-snapshot
Issues in the design of a parallel object-oriented language
inferred← citeshttps://doi.org/10.1007/bf02311231openalex-snapshot
P — A logic — a compositional proof system for distributed programs
inferred← citeshttps://doi.org/10.1007/bf02737106openalex-snapshot
A proof system for distributed processes
inferred← citeshttps://doi.org/10.1007/bf02811338openalex-snapshot
An introduction to compositional methods for concurrency and their application to real-time
inferred← citeshttps://doi.org/10.1007/bf02983373openalex-snapshot
Proof theory for exception handling in a tasking environment
inferred← citeshttps://doi.org/10.1007/bfb0019365openalex-snapshot
A compositional proof system for distributed programs
inferred← citeshttps://doi.org/10.1007/bfb0019442openalex-snapshot
A proof system for the language POOL
inferred← citeshttps://doi.org/10.1007/bfb0026105openalex-snapshot
Expressiveness bounds for completeness in trace-based network proof systems
inferred← citeshttps://doi.org/10.1007/bfb0027044openalex-snapshot
The quest goes on: A survey of proofsystems for partial correctness of CSP
inferred← citeshttps://doi.org/10.1007/bfb0027046openalex-snapshot
Process theory: Semantics, specification and verification
inferred← citeshttps://doi.org/10.1007/bfb0032059openalex-snapshot
A proof system for the parallel object-oriented language POOL
inferred← citeshttps://doi.org/10.1007/bfb0039074openalex-snapshot
Proving termination of communicating programs
inferred← citeshttps://doi.org/10.1007/bfb0055629openalex-snapshot
Reasoning about asynchronous communication in dynamically evolving object structures
inferred← citeshttps://doi.org/10.1007/bfb0058036openalex-snapshot
Hoare-Style compositional proof systems for reactive shared variable concurrency
inferred← citeshttps://doi.org/10.1007/s002360050039openalex-snapshot
Parallel composition of assumption-commitment specifications
inferred← citeshttps://doi.org/10.1016/0167-739x(90)90025-9openalex-snapshot
Compositionality in the temporal logic of concurrent systems (extended abstract)
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90390-nopenalex-snapshot
Correctness of concurrent processes
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90053-iopenalex-snapshot
A compositional axiomatization of Statecharts
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90093-0openalex-snapshot
Program composition via unification
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90020-xopenalex-snapshot
Compositional semantics for real-time distributed computing
inferred← citeshttps://doi.org/10.1016/b978-0-408-03741-9.50021-0openalex-snapshot
Formal description of realtime systems
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.1109/32.58782openalex-snapshot
The specification and verified decomposition of system requirements using CSP
inferred← citeshttps://doi.org/10.1109/hol.1991.596303openalex-snapshot
Reasoning About Petri Nets In HOL
inferred← citeshttps://doi.org/10.1109/icsmc.1993.384959openalex-snapshot
An introduction to Gina
inferred← citeshttps://doi.org/10.1109/lics.1991.151663openalex-snapshot
A compositional proof system for dynamic process creation
inferred← citeshttps://doi.org/10.1109/tc.2014.2329701openalex-snapshot
Compositional Model Checking of Concurrent Systems
inferred← citeshttps://doi.org/10.1109/tii.2018.2807400openalex-snapshot
The Extension of Semantic Formalization of Service Workflow Specification Language
inferred← citeshttps://doi.org/10.1145/129393.129396openalex-snapshot
Trace-based network proof systems
inferred← citeshttps://doi.org/10.1145/1740582.1740584openalex-snapshot
On the completeness of compositional reasoning methods
inferred← citeshttps://doi.org/10.1145/174662.174665openalex-snapshot
Compositional specification and verification of distributed systems
inferred← citeshttps://doi.org/10.1145/41625.41628openalex-snapshot
Completeness and incompleteness of trace-based network proof systems
inferred← citeshttps://doi.org/10.1145/41840.41856openalex-snapshot
Specifying message passing systems requires extending temporal logic
inferred← citeshttps://doi.org/10.1145/75199.75214openalex-snapshot
Reasoning of real-time distributed programming languages
inferred← citeshttps://doi.org/10.1145/75200.75214openalex-snapshot
Reasoning of real-time distributed programming languages
inferred← citeshttps://doi.org/10.5772/38583openalex-snapshot
Dynamic Control in Embedded Systems
inferred← citeshttps://doi.org/10.82444/warw.33803119openalex-snapshot
A temporal logic for the specification and verification of real-time systems
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.