Partial-Order Reduction

DOI10.1007/978-3-319-10575-8_6MaRDI QIDQ3176364zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cites work

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

Cited in

(26)

• A geometric view of partial order reduction
• Partial Sheffer operations
• Start pruning when time gets urgent: partial order reduction for timed systems
• scientific article; zbMATH DE number 1956603 (Why is no real title available?)
• Exploring the scope for partial order reduction
• Partial order reduction for checking LTL formulae with the next-time operator
• scientific article; zbMATH DE number 1507206 (Why is no real title available?)
• scientific article; zbMATH DE number 1973997 (Why is no real title available?)
• scientific article; zbMATH DE number 1538043 (Why is no real title available?)
• Optimistic synchronization-based state-space reduction
• Approximate partial order reduction
• scientific article; zbMATH DE number 1515293 (Why is no real title available?)
• Non-uniform reductions
• scientific article; zbMATH DE number 5577999 (Why is no real title available?)
• Combining partial-order reductions with on-the-fly model-checking.
• State space reduction using partial order techniques
• Relaxed visibility enhances partial order reduction
• Explicit-state model checking
• Partial-order reduction in symbolic state-space exploration
• Completion for multiple reduction orderings
• Model Checking Security Protocols
• Automated Technology for Verification and Analysis
• Executable contracts for Elixir
• Comparing Source Sets and Persistent Sets for Partial Order Reduction
• Partial order reduction for verification of spatial properties of pi-calculus processes
• Partial order reductions for timed systems

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)