Dynamic partial-order reduction for model checking software
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2087625
- Dynamic reductions for model checking concurrent software
- Formal verification of a partial-order reduction technique for model checking
- Partial-order reduction techniques for real-time model checking
- Dynamic Path Reduction for Software Model Checking
- Combining partial-order reductions with on-the-fly model-checking.
- scientific article; zbMATH DE number 1361136
Cited in
(62)- Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
- Dynamic Path Reduction for Software Model Checking
- Independence abstractions and models of concurrency
- Verifying the correctness of distributed systems via mergeable parallelism
- A geometric view of partial order reduction
- Stateless model checking under a reads-value-from equivalence
- Model checking concurrent programs
- Partial order reduction for deep bug finding in synchronous hardware
- Compositional correctness and completeness for symbolic partial order reduction
- Compositional verification of priority systems using sharp bisimulation
- Actor-based model checking for software-defined networks
- Exploring the scope for partial order reduction
- scientific article; zbMATH DE number 2087625 (Why is no real title available?)
- SDN-actors: modeling and verification of SDN programs
- Goal-driven unfolding of Petri nets
- Analysis and Transformation of Constrained Horn Clauses for Program Verification
- Hybrid analysis for partial order reduction of programs with arrays
- Symmetry and partial order reduction techniques in model checking Rebeca
- Software model checking with explicit scheduler and symbolic threads
- Composing model programs for analysis
- scientific article; zbMATH DE number 1973997 (Why is no real title available?)
- Stateless model checking for TSO and PSO
- Dynamic reductions for model checking concurrent software
- Quantifiability: a concurrent correctness condition modeled in vector space
- Symbolic predictive analysis for concurrent programs
- Peephole Partial Order Reduction
- Approximate partial order reduction
- Prefix-based tracing in message-passing concurrency
- Context-aware counter abstraction
- Local Data Race Freedom with Non-multi-copy Atomicity
- Operational semantics with semicommutations
- Optimising the ProB model checker for B using partial order reduction
- Combining partial-order reductions with on-the-fly model-checking.
- Combining model checking and testing
- A pragmatic approach to stateful partial order reduction
- Global reproducibility through local control for distributed active objects
- Multithreaded testing of program interfaces
- Unfolding-based dynamic partial order reduction of asynchronous distributed programs
- Partial order reduction for rewriting semantics of programming languages
- Dynamic Partial Order Reduction Using Probe Sets
- What's wrong with on-the-fly partial order reduction
- Computing race variants in message-passing concurrent programming with selective receives
- POR for security protocol equivalences. Beyond action-determinism
- Quasi-optimal partial order reduction
- Automating memory model metatheory with intersections
- Model Checking Software
- Automatic analysis of DMA races using model checking and k-induction
- Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings
- Bisimulation conversion and verification procedure for goal-based control systems
- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip
- Compositional verification of asynchronous concurrent systems using CADP
- Hypernode automata
- A Study of Model-Order Reduction Techniques for Verification
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
- Exploiting object escape and locking information in partial-order reductions for concurrent object-oriented programs
- Sound and complete monitoring of sequential consistency for relaxed memory models
- Efficient trace encodings of bounded synthesis for asynchronous distributed systems
- Awaiting for Godot: stateless model checking that avoids executions where nothing happens
- Reconciling preemption bounding with DPOR
- Unblocking dynamic partial order reduction
- Verification of SpecC using predicate abstraction
- Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
This page was built for publication: Dynamic partial-order reduction for model checking software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276139)
