Pages that link to "Item:Q3922144"

The following pages link to A Proof System for Communicating Sequential Processes (Q3922144):

Displaying 50 items.

• Verification of object-oriented programs: a transformational approach (Q439944) (← links)
• The pursuit of deadlock freedom (Q580970) (← links)
• P-A logic - a compositional proof system for distributed programs (Q757079) (← links)
• A weakest precondition semantics for communicating processes (Q789174) (← links)
• A complete axiomatic semantics of spawning (Q808281) (← links)
• Computation of equilibria in noncooperative games (Q815274) (← links)
• Issues in the design of a parallel object-oriented language (Q909434) (← links)
• Verifying atomic data types (Q914403) (← links)
• Proof theory for exception handling in a tasking environment (Q918725) (← links)
• A shared-variable concurrency analysis of multi-threaded object-oriented programs (Q1004057) (← links)
• On the suitability of trace semantics for modular proofs of communicating processes (Q1060004) (← links)
• Specification-oriented semantics for communicating processes (Q1060838) (← links)
• An axiomatic semantics for nested concurrency (Q1077155) (← links)
• Total correctness of CSP programs (Q1079011) (← links)
• Transformations for communication fairness in CSP (Q1089786) (← links)
• Communication in concurrent dynamic logic (Q1095653) (← links)
• A proof system for distributed processes (Q1106014) (← links)
• Semantics and verification of monitors and systems of monitors and processes (Q1112588) (← links)
• Semantics of nondeterminism, concurrency, and communication (Q1139946) (← links)
• On the use of history variables (Q1145994) (← links)
• A proof technique for communicating sequential processes (Q1153686) (← links)
• Towards a foundation for semantics in complete metric spaces (Q1173767) (← links)
• Design and verification of fault tolerant systems with CSP (Q1176076) (← links)
• A class of systems with nearly zero distributed simulation overhead (Q1194808) (← links)
• Efficient distributed simulation of acyclic systems (Q1194817) (← links)
• Verification of distributed programs using representative interleaving sequences (Q1200917) (← links)
• Reasoning about dynamically evolving process structures (Q1333406) (← links)
• A principle for sequential reasoning about distributed algorithms (Q1346611) (← links)
• An assertion-based proof system for multithreaded Java (Q1770359) (← links)
• A brief history of process algebra (Q1781995) (← links)
• Corrigenda:Cooperating proofs for distributed programs with multiparty interactions (Q1813353) (← links)
• Correctness proofs of CSP programs (Q1838826) (← links)
• Distributed automata in an assumption-commitment framework (Q1847547) (← links)
• A system for compositional verification of asynchronous objects (Q1951610) (← links)
• Semantic specification and verification of data flow diagrams (Q2277862) (← links)
• Fifty years of Hoare's logic (Q2280214) (← links)
• Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
• Deadlock-freedom in component systems with architectural constraints (Q2441719) (← links)
• A proof outline logic for object-oriented programming (Q2571207) (← links)
• Deadlock analysis in networks of communicating processes (Q2638755) (← links)
• Interleaving set temporal logic (Q2639046) (← links)
• The laws of Occam programming (Q2640348) (← links)
• Mitigating Multi-target Attacks in Hash-Based Signatures (Q2798784) (← links)
• The Automatic Detection of Token Structures and Invariants Using SAT Checking (Q3303932) (← links)
• Compositional Verification for Component-Based Systems and Application (Q3540064) (← links)
• Temporal predicate transition nets—a new formalism for specifying and verifying concurrent systems (Q4032915) (← links)
• AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗ (Q4485121) (← links)
• A proof system for asynchronously communicating deterministic processes (Q5096883) (← links)
• Safety assurance via on-line monitoring (Q5138497) (← links)
• Using Hoare Logic in a Process Algebra Setting (Q5164860) (← links)