Pages that link to "Item:Q1219675"
From MaRDI portal
The following pages link to An axiomatic proof technique for parallel programs (Q1219675):
Displaying 50 items.
- Invariants for the construction of a handshake register (Q293438) (← links)
- A coinductive calculus for asynchronous side-effecting processes (Q393094) (← links)
- Verification of object-oriented programs: a transformational approach (Q439944) (← links)
- Starvation-free mutual exclusion with semaphores (Q469360) (← links)
- A dynamic logic for deductive verification of multi-threaded programs (Q470007) (← links)
- Towards formally specifying and verifying transactional memory (Q470040) (← links)
- A proof system for adaptable class hierarchies (Q478383) (← links)
- Queue based mutual exclusion with linearly bounded overtaking (Q532419) (← links)
- Incremental reasoning with lazy behavioral subtyping for multiple inheritance (Q549694) (← links)
- Auxiliary variables in partial correctness programming logics (Q582037) (← links)
- Formal derivation of an algorithm for distributed phase synchronization (Q673351) (← links)
- On using temporal logic for refinement and compositional verification of concurrent systems (Q674008) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- Lazy behavioral subtyping (Q710675) (← links)
- Synchronous Kleene algebra (Q710676) (← links)
- Correctness and concurrent complexity of the black-white bakery algorithm (Q736464) (← links)
- Verifying traits: an incremental proof system for fine-grained reuse (Q736803) (← links)
- Derivation of concurrent programs by stepwise scheduling of Event-B models (Q736912) (← links)
- A weakest precondition semantics for communicating processes (Q789174) (← links)
- Fair termination revisited - with delay (Q795499) (← links)
- A proof technique for parallel programs (Q796292) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- Integrating Owicki-Gries for C11-style memory models into Isabelle/HOL (Q832723) (← links)
- Splitting atoms safely (Q879357) (← links)
- A semantics for concurrent separation logic (Q879367) (← links)
- Resources, concurrency, and local reasoning (Q879368) (← links)
- Balancing expressiveness in formal approaches to concurrency (Q890478) (← links)
- Interpreting one concurrent calculus in another (Q915484) (← 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)
- An implementation of mutual inclusion (Q1081297) (← links)
- The formal development of a parallel program performing LU-decomposition (Q1096311) (← links)
- On the programs-as-formulas interpretation of parallel programs in Peano arithmetic (Q1100878) (← links)
- Fairness and the axioms of control predicates (Q1104729) (← links)
- Global renaming operators in concrete process algebra (Q1106660) (← links)
- A generalization of Owicki-Gries's Hoare logic for a concurrent while language (Q1107518) (← links)
- Atomic semantics of nonatomic programs (Q1111361) (← links)
- Semantics of nondeterminism, concurrency, and communication (Q1139946) (← links)
- The temporal semantics of concurrent programs (Q1143164) (← links)
- Arithmetical completeness in first-order dynamic logic for concurrent programs (Q1155351) (← links)
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) (Q1190479) (← links)
- A compositional protocol verification using relativized bisimulation (Q1193593) (← links)
- Defining conditional independence using collapses (Q1194331) (← links)
- A class of systems with nearly zero distributed simulation overhead (Q1194808) (← links)
- A starvation-free solution to the mutual exclusion problem (Q1253914) (← links)
- Joining specification statements (Q1285666) (← links)
- Relation-based semantics for concurrency (Q1328556) (← links)
- Process algebra with guards: Combining hoare logic with process algebra (Q1329197) (← links)
- A principle for sequential reasoning about distributed algorithms (Q1346611) (← links)
- The Rely-Guarantee method for verifying shared variable concurrent programs (Q1362776) (← links)
