On the public citation graph

Compositionality, Concurrency and Partial Correctness

https://doi.org/10.1007/bfb0020836

0 signed · 98 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 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-48340-3_31openalex-snapshot

The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes

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_10openalex-snapshot

Compositional Verification of Real-Time Applications

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-49213-5_25openalex-snapshot

Compositional proof methods for concurrency: A semantic approach

inferred← citeshttps://doi.org/10.1007/3-540-49254-2_3openalex-snapshot

Ideal Stream Algebra

inferred← citeshttps://doi.org/10.1007/3-540-50940-2_33openalex-snapshot

Formulas, processes, and Petri-Nets applied to the specification and verification of a HDLC protocol

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-54152-7_65openalex-snapshot

A denotational real-time semantics for shared processors

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-54415-1_47openalex-snapshot

Towards a complete hierarchy of compositional dataflow models

inferred← citeshttps://doi.org/10.1007/3-540-54430-5_81openalex-snapshot

Towards a design calculus for communicating programs

inferred← citeshttps://doi.org/10.1007/3-540-55719-9_111openalex-snapshot

Interfaces between languages for communicating systems

inferred← citeshttps://doi.org/10.1007/3-540-56596-5_37openalex-snapshot

Towards an epistemic approach to reasoning about concurrent programs

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

Trace-based compositional reasoning about fault tolerant systems

inferred← citeshttps://doi.org/10.1007/3-540-57208-2_5openalex-snapshot

Modular completeness for Communication Closed Layers

inferred← citeshttps://doi.org/10.1007/3-540-57318-6_27openalex-snapshot

A compositional approach to the design of hybrid systems

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-59293-8_225openalex-snapshot

A gentle introduction to specification engineering using a case study in telecommunications

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-60117-1_11openalex-snapshot

A compositional proof system for asynchronously communicating processes

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_103openalex-snapshot

The incremental development of correct specifications for 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-61604-7_87openalex-snapshot

Synchronous development of asynchronous systems

inferred← citeshttps://doi.org/10.1007/3-540-63533-5_27openalex-snapshot

A compositional proof system for shared variable concurrency

inferred← citeshttps://doi.org/10.1007/3540547428_46openalex-snapshot

ASTRAL: An assertion language for specifying realtime systems

inferred← citeshttps://doi.org/10.1007/978-0-387-34685-4_5openalex-snapshot

Temporal Reasoning Of Reactive Web Services

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-1-4471-3229-5_14openalex-snapshot

Case Study: Stepwise Development of a Communication Processor using Trace Logic

inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_15openalex-snapshot

A Theory of State-based Parallel Programming: Part 1

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-3-319-41591-8_5openalex-snapshot

Refinement-Based Verification of Communicating Unstructured Code

inferred← citeshttps://doi.org/10.1007/978-3-319-46508-1_3openalex-snapshot

Archimedean Points: The Essence for Mastering Change

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

From Local Search to Global Behavior: Ad Hoc Network Example

inferred← citeshttps://doi.org/10.1007/978-3-642-01748-3_1openalex-snapshot

Modular Verification of Recursive Programs

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/978-3-642-88049-0_10openalex-snapshot

Formal Specification and Timing Analysis of High-Integrity Real-Time Systems

inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_38openalex-snapshot

A Denotational Real-Time Semantics for Shared Processors

inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_3openalex-snapshot

Deterministic Negotiations: Concurrency for Free

inferred← citeshttps://doi.org/10.1007/978-3-7091-4009-3_4openalex-snapshot

Tracing Fault Tolerance

inferred← citeshttps://doi.org/10.1007/978-3-7091-9396-9_24openalex-snapshot

Specification and Verification of an Atomic Broadcast Protocol

inferred← citeshttps://doi.org/10.1007/978-3-7091-9396-9_25openalex-snapshot

Trace-Based Compositional Refinement of Fault Tolerant Distributed Systems

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

Formal specification and compositional verification of an atomic broadcast protocol

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

A fully abstract trace model for dataflow and asynchronous networks

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

P — A logic — a compositional proof system for distributed programs

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/bfb0015460openalex-snapshot

KORSO reference languages concepts and application domains

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

A hierarchy of compositional models of I/O-automata (Extended Abstract)

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

Compositional verification of real-time systems using extended Hoare triples

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

Layering and action refinement for timed systems

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

Assumption-commitment in automata

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

Hoare-Style compositional proof systems for reactive shared variable concurrency

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

Sometimes ‘some’ is as good as ‘all’

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

Hoare Logic and Auxiliary Variables

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

Parallel composition of assumption-commitment specifications

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

The compositional approach to sequential consistency and lazy caching

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.1007/s10817-008-9111-8openalex-snapshot

Assumption–Commitment Support for CSP Model Checking

inferred← citeshttps://doi.org/10.1016/0020-0190(90)90073-7openalex-snapshot

On the completeness of modular proof systems

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/0304-3975(91)90390-nopenalex-snapshot

Correctness of concurrent processes

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.1016/0304-3975(94)90166-xopenalex-snapshot

A compositional framework for fault tolerance by specification transformation

inferred← citeshttps://doi.org/10.1016/0304-3975(94)90167-8openalex-snapshot

A trace-based compositional proof theory for fault tolerant distributed systems

inferred← citeshttps://doi.org/10.1016/b978-0-444-89901-9.50024-0openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/b978-1-4832-1453-5.50021-0openalex-snapshot

An Epistemic Proof System for Parallel Processes**A full version appeared as Technical Report No. 93-17.

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.05.033openalex-snapshot

Assumption-Commitment Support for CSP Model Checking

inferred← citeshttps://doi.org/10.1016/j.scico.2010.08.003openalex-snapshot

A system for compositional verification of asynchronous objects

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.1023/a:1021836202093openalex-snapshot

A Verification Framework for Agent Communication

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

Specification of realtime systems using ASTRAL

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.1109/icfem.1997.630415openalex-snapshot

Formally specifying and verifying real-time systems

inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016622openalex-snapshot

Composition and refinement for partial object specifications

inferred← citeshttps://doi.org/10.1109/metric.1993.263797openalex-snapshot

Validation of structure metrics: a case study

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

On compositionality and its limitations

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

Trace-based network proof systems

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

The composability of ASTRAL realtime specifications

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/174675.176925openalex-snapshot

Proving concurrent constraint programs correct

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

Predicates are predicate transformers: a unified compositional theory for concurrency

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

Rooting UNITY

inferred← citeshttps://doi.org/10.14236/ewic/fa1997.17openalex-snapshot

Communication Traces in the Verification of Distributed Programs

inferred← citeshttps://doi.org/10.14236/ewic/fm1998.8openalex-snapshot

An Unbounded Nondeterministic Model for CSP-like Languages

inferred← citeshttps://doi.org/10.14279/depositonce-4137openalex-snapshot

A mechanized verification environment for real-time process algebras and low-level programming languages

inferred← citeshttps://doi.org/10.3176/eng.1998.2.02openalex-snapshot

FORMAL VERIFICATION OF THE BINARY EXPONENTIAL BACKOFF PROTOCOL

inferred← citeshttps://doi.org/10.3233/fi-1994-201238openalex-snapshot

COMPOSITIONAL PROOFS FOR NETWORKS OF PROCESSES

inferred← citeshttps://doi.org/10.3233/fi-1996-281212openalex-snapshot

On the Power of Compositional Proofs for Nets: Relationships Between Completeness and Modularity

inferred← citeshttps://doi.org/10.3990/1.9789090082516openalex-snapshot

Software Measurement and Functional Programming

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.