Pages that link to "Item:Q795497"
From MaRDI portal
The following pages link to Adequate proof principles for invariance and liveness properties of concurrent programs (Q795497):
Displaying 18 items.
- Verifying atomic data types (Q914403) (← links)
- Atomic semantics of nonatomic programs (Q1111361) (← links)
- The power of temporal proofs (Q1118578) (← links)
- An operator net model for distributed systems (Q1123601) (← links)
- Completing the temporal picture (Q1176248) (← links)
- A criterion for atomicity (Q1192605) (← links)
- Specifying modules to satisfy interfaces: A state transition system approach (Q1193606) (← links)
- Axiomatic treatment of processes with shared variables revisited (Q1194205) (← links)
- Defining conditional independence using collapses (Q1194331) (← links)
- A verification system for concurrent programs based on the Boyer-Moore prover (Q1203115) (← links)
- A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol (Q1318283) (← links)
- Proving partial order properties (Q1322161) (← links)
- A mechanically verified incremental garbage collector (Q1336946) (← links)
- A methodology for designing proof rules for fair parallel programs (Q1377299) (← links)
- On relative and probabilistic finite counterability (Q1742987) (← links)
- Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- Interleaving set temporal logic (Q2639046) (← links)
