Pages that link to "Item:Q1219675"
From MaRDI portal
The following pages link to An axiomatic proof technique for parallel programs (Q1219675):
Displayed 50 items.
- 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)
- Theory and methodology of assumption/commitment based system interface specification and architectural contracts (Q1654563) (← links)
- Tournaments for mutual exclusion: verification and concurrent complexity (Q1682286) (← links)
- Conditions of contracts for separating responsibilities in heterogeneous systems (Q1742989) (← links)
- Hybrid process algebra (Q1763160) (← links)
- An assertion-based proof system for multithreaded Java (Q1770359) (← links)
- Invariants, composition, and substitution (Q1894676) (← links)
- Bounded delay for a free address (Q1901690) (← links)
- A system for compositional verification of asynchronous objects (Q1951610) (← links)
- A unified approach of program verification (Q2013885) (← links)
- A mechanized refinement proof of the Chase-Lev deque using a proof system (Q2218426) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Verifying a concurrent garbage collector with a rely-guarantee methodology (Q2319995) (← links)
- Proof-based verification approaches for dynamic properties: application to the information system domain (Q2355384) (← links)
- Automatic workflow verification and generation (Q2368986) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos (Q2377304) (← links)
- A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency (Q2414249) (← links)
- Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example (Q2418046) (← links)
- Compositional verification of a communication protocol for a remotely operated aircraft (Q2442952) (← links)
- A proof outline logic for object-oriented programming (Q2571207) (← links)
- Towards a Thread-Local Proof Technique for Starvation Freedom (Q2814127) (← links)
- Proof of OS Scheduling Behavior in the Presence of Interrupt-Induced Concurrency (Q2829245) (← links)
- Regression Verification for Multi-threaded Programs (Q2891406) (← links)
- A Program Construction and Verification Tool for Separation Logic (Q2941173) (← links)
- Proving Linearizability Using Partial Orders (Q2988662) (← links)
- Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs (Q3000591) (← links)
- Compositionality Entails Sequentializability (Q3000634) (← links)
- Axiomatic semantics of projection temporal logic programs (Q3060195) (← links)