Partial-Order Reduction

DOI10.1007/978-3-319-10575-8_6zbMATH Open1392.68262OpenAlexW2803341075MaRDI QIDQ3176364FDOQ3176364

Doron Peled

Publication date: 20 July 2018

Published in: Handbook of Model Checking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-10575-8_6

Recommendations

• Approximate partial order reduction
• scientific article; zbMATH DE number 1507206
• Unfolding-based partial order reduction
• Exploring the scope for partial order reduction
• Quasi-optimal partial order reduction
• Quasi-optimal partial order reduction
• Context-sensitive dynamic partial order reduction

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Characterizing finite Kripke structures in propositional temporal logic
• Title not available (Why is that?)
• A calculus of communicating systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Branching time and abstraction in bisimulation semantics
• Stutter-invariant temporal properties are expressible without the next-time operator
• Combining partial-order reductions with on-the-fly model-checking.
• An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
• Unfoldings: A partial-order approach to model checking.
• Three logics for branching bisimulation
• Title not available (Why is that?)
• Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
• Relaxed visibility enhances partial order reduction
• Title not available (Why is that?)
• Partial-order reduction in symbolic state-space exploration
• A partial order approach to branching time logic model checking.
• Defining conditional independence using collapses
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Title not available (Why is that?)
• On Commutativity Based Edge Lean Search

Cited In (21)

• Partial Sheffer operations
• Start pruning when time gets urgent: partial order reduction for timed systems
• Title not available (Why is that?)
• Exploring the scope for partial order reduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimistic synchronization-based state-space reduction
• Title not available (Why is that?)
• Non-uniform reductions
• Title not available (Why is that?)
• Combining partial-order reductions with on-the-fly model-checking.
• State space reduction using partial order techniques
• Relaxed visibility enhances partial order reduction
• Partial-order reduction in symbolic state-space exploration
• Completion for multiple reduction orderings
• Model Checking Security Protocols
• Executable contracts for Elixir
• Automated Technology for Verification and Analysis
• Comparing Source Sets and Persistent Sets for Partial Order Reduction
• Explicit-State Model Checking

This page was built for publication: Partial-Order Reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176364)