The following pages link to Reduction (Q4077431):
Displaying 40 items.
- Simulation refinement for concurrency verification (Q541209) (← links)
- Modular verification of multithreaded programs (Q557795) (← links)
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
- Accelerating the computation of dead and concurrent places using reductions (Q832013) (← links)
- Optimistic synchronization-based state-space reduction (Q853724) (← links)
- A theorem on atomicity in distributed algorithms (Q913499) (← links)
- Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← links)
- Proving the correctness of client/server software (Q1040009) (← links)
- Simulation, reduction and preservation of correctness properties of parallel systems (Q1054477) (← links)
- Transformational semantics for concurrent programs (Q1144920) (← links)
- On reduction of asynchronous systems (Q1241274) (← links)
- Commutation properties and generating sets characterize slices of various synchronization primitives (Q1256315) (← links)
- Program refinement in fair transition systems (Q1323314) (← links)
- Procedures and atomicity refinement (Q1350927) (← links)
- Composing leads-to properties (Q1575647) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Homomorphisms between models of parallel computation (Q1836982) (← links)
- Using refinement calculus techniques to prove linearizability (Q1941870) (← links)
- On the combination of polyhedral abstraction and SMT-based model checking for Petri nets (Q2117166) (← links)
- Flashix: modular verification of a concurrent and crash-safe flash file system (Q2117600) (← links)
- Guessing the buffer bound for k-synchronizability (Q2117668) (← links)
- LTL under reductions with weaker conditions than stutter invariance (Q2165225) (← links)
- On the \(k\)-synchronizability of systems (Q2200819) (← links)
- Synthesizing precise and useful commutativity conditions (Q2208295) (← links)
- A mechanized refinement proof of the Chase-Lev deque using a proof system (Q2218426) (← links)
- Checking robustness between weak transactional consistency models (Q2233450) (← links)
- Decomposing data structure commutativity proofs with \(mn\)-differencing (Q2234060) (← links)
- A reduction theorem for randomized distributed algorithms under weak adversaries (Q2234073) (← links)
- Refinement algebra for probabilistic programs (Q2268474) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (Q2946743) (← links)
- Dynamic Reductions for Model Checking Concurrent Software (Q2961569) (← links)
- Proving Isolation Properties for Software Transactional Memory (Q3000572) (← links)
- (Q5009435) (← links)
- (Q5091106) (← links)
- (Q5111454) (← links)
- Simulation Refinement for Concurrency Verification (Q5403461) (← links)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) (← links)
- Guessing the Buffer Bound for k-Synchronizability (Q6070755) (← links)
