Pages that link to "Item:Q5276139"
From MaRDI portal
The following pages link to Dynamic partial-order reduction for model checking software (Q5276139):
Displayed 40 items.
- A geometric view of partial order reduction (Q265807) (← links)
- Symbolic predictive analysis for concurrent programs (Q432146) (← links)
- Context-aware counter abstraction (Q600978) (← links)
- Bisimulation conversion and verification procedure for goal-based control systems (Q633304) (← links)
- Composing model programs for analysis (Q710670) (← links)
- Automatic analysis of DMA races using model checking and \(k\)-induction (Q763238) (← links)
- Stateless model checking under a reads-value-from equivalence (Q832184) (← links)
- Symmetry and partial order reduction techniques in model checking Rebeca (Q845239) (← links)
- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip (Q1041294) (← links)
- Stateless model checking for TSO and PSO (Q1683934) (← links)
- Actor-based model checking for software-defined networks (Q1996852) (← links)
- SDN-actors: modeling and verification of SDN programs (Q2024371) (← links)
- Approximate partial order reduction (Q2024376) (← links)
- Operational semantics with semicommutations (Q2043812) (← links)
- Quasi-optimal partial order reduction (Q2050101) (← links)
- Verifying the correctness of distributed systems via mergeable parallelism (Q2154028) (← links)
- Computing race variants in message-passing concurrent programming with selective receives (Q2165226) (← links)
- POR for security protocol equivalences. Beyond action-determinism (Q2167736) (← links)
- Compositional verification of asynchronous concurrent systems using CADP (Q2350492) (← links)
- Verification of SpecC using predicate abstraction (Q2369884) (← links)
- Multithreaded testing of program interfaces (Q2654998) (← links)
- Partial Order Reduction for Rewriting Semantics of Programming Languages (Q2873775) (← links)
- Independence Abstractions and Models of Concurrency (Q2961560) (← links)
- Dynamic Reductions for Model Checking Concurrent Software (Q2961569) (← links)
- Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory Models (Q3000633) (← links)
- Model Checking Concurrent Programs (Q3176376) (← links)
- Combining Model Checking and Testing (Q3176377) (← links)
- Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems (Q3297600) (← links)
- Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings (Q3512483) (← links)
- Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions (Q3540069) (← links)
- Dynamic Partial Order Reduction Using Probe Sets (Q3541021) (← links)
- Exploring the Scope for Partial Order Reduction (Q3648689) (← links)
- Global Reproducibility Through Local Control for Distributed Active Objects (Q5039528) (← links)
- (Q5111631) (← links)
- Local Data Race Freedom with Non-multi-copy Atomicity (Q5883581) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
- Prefix-based tracing in message-passing concurrency (Q6102258) (← links)
- A pragmatic approach to stateful partial order reduction (Q6132490) (← links)
- Quantifiability: a concurrent correctness condition modeled in vector space (Q6161035) (← links)
- Unfolding-based dynamic partial order reduction of asynchronous distributed programs (Q6190188) (← links)
