A Proof System for Communicating Sequential Processes
From MaRDI portal
Cited in
(60)- Transformations for communication fairness in CSP
- The laws of Occam programming
- A small step for mankind
- A proof system for a PGAS language
- Towards a foundation for semantics in complete metric spaces
- A proof system for distributed processes
- Verification of distributed programs using representative interleaving sequences
- Semantics and verification of monitors and systems of monitors and processes
- Fifty years of Hoare's logic
- P-A logic - a compositional proof system for distributed programs
- The need for compositional proof systems: a survey
- Using Hoare logic in a process algebra setting
- Mitigating multi-target attacks in hash-based signatures
- Reasoning about dynamically evolving process structures
- AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗
- Semantic specification and verification of data flow diagrams
- Verification of object-oriented programs: a transformational approach
- Communication in concurrent dynamic logic
- The pursuit of deadlock freedom
- Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems
- Safety assurance via on-line monitoring
- On the use of history variables
- Semantics of nondeterminism, concurrency, and communication
- A proof technique for communicating sequential processes
- A shared-variable concurrency analysis of multi-threaded object-oriented programs
- Interleaving set temporal logic
- A Sound and Complete Shared-Variable Concurrency Model for Multi-threaded Java Programs
- Models and logics for true concurrency.
- A proof system for asynchronously communicating deterministic processes
- A brief history of process algebra
- Design and verification of fault tolerant systems with CSP
- An axiomatic semantics for nested concurrency
- Total correctness of CSP programs
- Verifying atomic data types
- A system for compositional verification of asynchronous objects
- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs
- Corrigenda:Cooperating proofs for distributed programs with multiparty interactions
- Proof theory for exception handling in a tasking environment
- A Bibliography of Willem-Paul de Roever
- A weakest precondition semantics for communicating processes
- On the suitability of trace semantics for modular proofs of communicating processes
- Compositional Verification for Component-Based Systems and Application
- A class of systems with nearly zero distributed simulation overhead
- Efficient distributed simulation of acyclic systems
- Correctness proofs of CSP programs
- Deadlock analysis in networks of communicating processes
- An assertion-based proof system for multithreaded Java
- Issues in the design of a parallel object-oriented language
- Specification-oriented semantics for communicating processes
- A proof outline logic for object-oriented programming
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
- A complete axiomatic semantics of spawning
- An introduction to compositional methods for concurrency and their application to real-time.
- The automatic detection of token structures and invariants using SAT checking
- A principle for sequential reasoning about distributed algorithms
- Logical models of discrete even systems: a comparative exposition
- Reasoning about recursive processes in shared-variable concurrency
- Computation of equilibria in noncooperative games
- Deadlock-freedom in component systems with architectural constraints
- Distributed automata in an assumption-commitment framework
This page was built for publication: A Proof System for Communicating Sequential Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922144)
