On the public citation graph
P — A logic — a compositional proof system for distributed programs
0 signed · 73 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-11981-7_17openalex-snapshot
An operational semantics for CSP
inferredcites →https://doi.org/10.1007/3-540-15670-4_14openalex-snapshot
An improved failures model for communicating processes
inferredcites →https://doi.org/10.1007/3-540-52559-9_81openalex-snapshot
Some comments on the assumption-commitment framework for compositional verification of distributed programs
inferredcites →https://doi.org/10.1007/bf00289074openalex-snapshot
A proof method for cyclic programs
inferredcites →https://doi.org/10.1007/bf00289266openalex-snapshot
A proof technique for communicating sequential processes
inferredcites →https://doi.org/10.1007/bfb0015776openalex-snapshot
Compositionality and concurrent networks: Soundness and completeness of a proofsystem
inferredcites →https://doi.org/10.1007/bfb0020836openalex-snapshot
Compositionality, Concurrency and Partial Correctness
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1016/0020-0190(86)90132-8openalex-snapshot
Safety without stuttering
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0167-6423(81)90005-8openalex-snapshot
A calculus of total correctness for communicating processes
inferredcites →https://doi.org/10.1016/0304-3975(83)90045-2openalex-snapshot
Correctness proofs of CSP programs
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1145/318593.318624openalex-snapshot
A model and temporal proof system for networks of processes
inferredcites →https://doi.org/10.1145/323596.323601openalex-snapshot
A model and proof system for asynchronous networks
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/41625.41628openalex-snapshot
Completeness and incompleteness of trace-based network proof systems
inferredcites →https://doi.org/10.1145/567446.567463openalex-snapshot
"Sometime" is sometimes "not never"
inferredcites →https://doi.org/10.1145/800220.806698openalex-snapshot
Proving safety and liveness of communicating processes with examples
inferredcites →https://doi.org/10.25405/ncl.34125705openalex-snapshot
Specification and Design 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/10722167_14openalex-snapshot
On the Completeness of Compositional Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_12openalex-snapshot
A Perfecto Verification: Combining Model Checking with Deductive Analysis to Verify Real-Life Software
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_68openalex-snapshot
Foundations for Circular Compositional Reasoning
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-49213-5_11openalex-snapshot
Compositional Proofs for Concurrent Objects
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_21openalex-snapshot
Lazy Compositional Verication
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_22openalex-snapshot
Compositional Reasoning Using the Assumption-Commitment Paradigm
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_2openalex-snapshot
Combining Petri Nets and other formal methods
inferred← citeshttps://doi.org/10.1007/3-540-58450-1_54openalex-snapshot
Towards a mechanically supported and compositional calculus to design distributed algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_64openalex-snapshot
Logical foundations for compositional verification and development of concurrent programs in UNITY
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_49openalex-snapshot
Local liveness for compositional modeling of fair reactive systems
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_23openalex-snapshot
A refinement relation supporting the transition from unbounded to bounded communication buffers
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-60692-0_43openalex-snapshot
Verifying part of the ACCESS.bus protocol using PVS
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-61055-3_48openalex-snapshot
Assumption/commitment rules for dataflow networks — with an emphasis on completeness
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_12openalex-snapshot
A Unified Model for CSP-like Languages with Specifications
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_8openalex-snapshot
A proof theory of asynchronously communicating sequential processes
inferred← citeshttps://doi.org/10.1007/978-3-319-69483-2_7openalex-snapshot
Compositional Hoare-Style Reasoning About Hybrid CSP in the Duration Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_28openalex-snapshot
Abstract Patterns of Compositional Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_22openalex-snapshot
On Unifying Assumption—Commitment Style Proof Rules for Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-540-71067-7openalex-snapshot
Theorem Proving in Higher Order Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_13openalex-snapshot
An Assume/Guarantee Based Compositional Calculus for Hybrid CSP
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/bf01214554openalex-snapshot
Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm
inferred← citeshttps://doi.org/10.1007/bf02717184openalex-snapshot
Distributed automata in an assumption-commitment framework
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/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.1007/s10703-017-0304-9openalex-snapshot
Theory and methodology of assumption/commitment based system interface specification and architectural contracts
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90041-8openalex-snapshot
An explanatory presentation of composition rules for assumption-commitment specifications
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00017-4openalex-snapshot
Composition of assumption-commitment specifications in a UNITY style
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.006openalex-snapshot
Modular verification of multithreaded programs
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00038-7openalex-snapshot
A rely–guarantee discipline for open distributed systems design
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00327-1openalex-snapshot
A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
inferred← citeshttps://doi.org/10.1017/s0269888909990270openalex-snapshot
Specifying and Analyzing Institutions in Multi-Agent Systems using Answer Set Programming
inferred← citeshttps://doi.org/10.1109/csd.1998.657556openalex-snapshot
A presentation of regular languages in the assumption-commitment framework
inferred← citeshttps://doi.org/10.1145/1080334.1080337openalex-snapshot
The open family of temporal logics
inferred← citeshttps://doi.org/10.1145/1740582.1740584openalex-snapshot
On the completeness of compositional reasoning methods
inferred← citeshttps://doi.org/10.1145/3779649openalex-snapshot
Analysing a Library of Concurrency Primitives using CSP
inferred← citeshttps://doi.org/10.3384/diss.diva-173568openalex-snapshot
Parameterized Verification of Synchronized Concurrent Programs
inferred← citeshttps://doi.org/10.7551/mitpress/5641.003.0016openalex-snapshot
Enhancing the Tractability of Rely/Guarantee Specifications in the Development of Interfering Operations
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.