On the public citation graph
Ten years of partial order reduction
0 signed · 124 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1994.1035openalex-snapshot
A Partial Approach to Model Checking
inferredcites →https://doi.org/10.1007/3-540-10003-2_69openalex-snapshot
Characterizing correctness properties of parallel programs using fixpoints
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/3-540-53863-1_36openalex-snapshot
Stubborn sets for reduced state space generation
inferredcites →https://doi.org/10.1007/3-540-56922-7_33openalex-snapshot
On-the-fly verification with stubborn sets
inferredcites →https://doi.org/10.1007/3-540-56922-7_34openalex-snapshot
All from one, one for all: on model checking using representatives
inferredcites →https://doi.org/10.1007/3-540-56922-7_36openalex-snapshot
Refining dependencies improves partial-order verification methods (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-61042-1_48openalex-snapshot
Formal verification of a partial-order reduction technique for model checking
inferredcites →https://doi.org/10.1007/3-540-61604-7_78openalex-snapshot
An algorithmic approach for checking closure properties of Ω-regular languages
inferredcites →https://doi.org/10.1007/3-540-63166-6_33openalex-snapshot
Relaxed visibility enhances partial order reduction
inferredcites →https://doi.org/10.1007/3-540-63166-6_34openalex-snapshot
Partial-order reduction in symbolic state space exploration
inferredcites →https://doi.org/10.1007/978-0-387-34878-0_13openalex-snapshot
An Improvement in Formal Verification
inferredcites →https://doi.org/10.1007/978-0-387-34892-6_1openalex-snapshot
Simple On-the-fly Automatic Verification of Linear Temporal Logic
inferredcites →https://doi.org/10.1007/bf00121128openalex-snapshot
Memory-efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1007/bf00121262openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1007/bf02252682openalex-snapshot
Verification of distributed programs using representative interleaving sequences
inferredcites →https://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1016/0304-3975(88)90098-9openalex-snapshot
Characterizing finite Kripke structures in propositional temporal logic
inferredcites →https://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferredcites →https://doi.org/10.1016/0304-3975(94)90009-4openalex-snapshot
Proving partial order properties
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/0898-1221(95)90267-8openalex-snapshot
Computer-aided verification of coordinating processes: The automata-theoretic approach
inferredcites →https://doi.org/10.1016/b978-0-444-89874-6.50028-3openalex-snapshot
Coverage Preserving Reduction Strategies for Reachability Analysis
inferredcites →https://doi.org/10.1016/s0020-0190(97)00133-6openalex-snapshot
Stutter-invariant temporal properties are expressible without the next-time operator
inferredcites →https://doi.org/10.1016/s0304-3975(96)00225-3openalex-snapshot
On projective and separable properties
inferredcites →https://doi.org/10.1109/istcs.1995.377038openalex-snapshot
A partial order approach to branching time logic model checking
inferredcites →https://doi.org/10.1109/lics.1990.113739openalex-snapshot
Three logics for branching bisimulation
inferredcites →https://doi.org/10.1109/lics.1991.151664openalex-snapshot
A partial approach to model checking
inferredcites →https://doi.org/10.1109/lics.1996.561357openalex-snapshot
Partial-order methods for model checking: from linear time to branching time
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/226295.226324openalex-snapshot
Using partial-order methods in the formal validation of industrial concurrent programs
inferredcites →https://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722468_10openalex-snapshot
Correctness by Construction: Towards Verification in Hierarchical System Development
inferred← citeshttps://doi.org/10.1007/10722468_3openalex-snapshot
Model Checking Based on Simultaneous Reachability Analysis
inferred← citeshttps://doi.org/10.1007/11609773_16openalex-snapshot
Parallel External Directed Model Checking with Linear I/O
inferred← citeshttps://doi.org/10.1007/11751113_14openalex-snapshot
An Improved Case-Based Approach to LTL Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-36135-9_22openalex-snapshot
On Combining the Persistent Sets Method with the Covering Steps Graph Method
inferred← citeshttps://doi.org/10.1007/3-540-44464-5_14openalex-snapshot
On Model Checking Synchronised Hardware Circuits
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_24openalex-snapshot
Truth/SLC — A Parallel Verification Platform for Concurrent Systems
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_37openalex-snapshot
Parallel Model Checking for the Alternation Free μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_10openalex-snapshot
Partial Order Reduction in Directed Model Checking
inferred← citeshttps://doi.org/10.1007/978-1-4419-9359-5_7openalex-snapshot
Translation Validation of High-Level Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-030-17297-8_1openalex-snapshot
Model Checking Approach to the Analysis of Biological Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-32505-3_12openalex-snapshot
Taming Concurrency for Verification Using Multiparty Session Types
inferred← citeshttps://doi.org/10.1007/978-3-031-57256-2_21openalex-snapshot
CPAchecker 2.3 with Strategy Selection
inferred← citeshttps://doi.org/10.1007/978-3-031-71177-0_30openalex-snapshot
Software Verification with CPAchecker 3.0: Tutorial and User Guide
inferred← citeshttps://doi.org/10.1007/978-3-032-06847-7_9openalex-snapshot
On-the-Fly Cone-of-Influence Reduction for Model Checking Concurrent Software
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_9openalex-snapshot
Preserving LTL Properties in Sweep-Line State Space Exploration with Partial-Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-22969-0_19openalex-snapshot
Techniques for Memory-Efficient Model Checking of C and C++ Code
inferred← citeshttps://doi.org/10.1007/978-3-319-68034-7_7openalex-snapshot
Compositional Model Checking Is Lively
inferred← citeshttps://doi.org/10.1007/978-3-319-95582-7_35openalex-snapshot
Approximate Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-99073-6_19openalex-snapshot
POR for Security Protocol Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-540-30579-8_27openalex-snapshot
Efficient Verification of Halting Properties for MPI Programs with Wildcard Receives
inferred← citeshttps://doi.org/10.1007/978-3-540-31810-1_12openalex-snapshot
Checking Secrecy by Means of Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-540-39979-7_7openalex-snapshot
Modeling and Model Checking Mobile Phone Payment Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_4openalex-snapshot
Slicing Concurrent Real-Time System Specifications for Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_39openalex-snapshot
Pruning State Spaces with Extended Beam Search
inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_4openalex-snapshot
Specifying and Verifying Event-Based Fairness Enhanced Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-00255-7_21openalex-snapshot
Partial Order Reduction for State/Event LTL
inferred← citeshttps://doi.org/10.1007/978-3-642-03829-7_6openalex-snapshot
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_19openalex-snapshot
Specification Languages for Stutter-Invariant Regular Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-19237-1_5openalex-snapshot
Reduction of Interrupt Handler Executions for Model Checking Embedded Software
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_9openalex-snapshot
Verification of Orchestration Systems Using Compositional Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-28891-3_25openalex-snapshot
Towards LTL Model Checking of Unmodified Thread-Based C & C++ Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-38874-3_3openalex-snapshot
Model Checking of Biological Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_1openalex-snapshot
A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_5openalex-snapshot
Quo Vadis Explicit-State Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-662-55862-1_7openalex-snapshot
Stubborn Set Intuition Explained
inferred← citeshttps://doi.org/10.1007/bf02945465openalex-snapshot
Combining static analysis and case-based search space partitioning for reducing peak memory in model checking
inferred← citeshttps://doi.org/10.1007/s10009-004-0151-zopenalex-snapshot
Partial-order reduction and trail improvement in directed model checking
inferred← citeshttps://doi.org/10.1007/s10009-012-0264-8openalex-snapshot
Modeling task systems using parameterized partial orders
inferred← citeshttps://doi.org/10.1007/s10664-018-9644-3openalex-snapshot
Querying distilled code changes to extract executable transformations
inferred← citeshttps://doi.org/10.1007/s10703-011-0126-0openalex-snapshot
Transparent partial order reduction
inferred← citeshttps://doi.org/10.1007/s12046-009-0004-2openalex-snapshot
Proving the correctness of client/server software
inferred← citeshttps://doi.org/10.1016/j.scico.2020.102493openalex-snapshot
Compositional model checking with divergence preserving branching bisimilarity is lively
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.08.009openalex-snapshot
Towards the hierarchical verification of reactive systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.035openalex-snapshot
A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties
inferred← citeshttps://doi.org/10.1023/a:1014305610452openalex-snapshot
From Petri Nets to Automata with Concurrency
inferred← citeshttps://doi.org/10.1023/b:form.0000033963.55470.9eopenalex-snapshot
Static Analysis for State-Space Reductions Preserving Temporal Logics
inferred← citeshttps://doi.org/10.1049/iet-cdt.2010.0156openalex-snapshot
Long-run order-independence of vector-based transition systems
inferred← citeshttps://doi.org/10.1109/access.2020.3034799openalex-snapshot
Symmetry Breaking in Model Checking of Fault-Tolerant Nuclear Instrumentation and Control Systems
inferred← citeshttps://doi.org/10.1109/access.2024.3427109openalex-snapshot
iSNEAK: Partial Ordering as Heuristics for Model- Based Reasoning in Software Engineering
inferred← citeshttps://doi.org/10.1109/acsd.2010.24openalex-snapshot
Order-Independence of Vector-Based Transition Systems
inferred← citeshttps://doi.org/10.1109/ams.2007.75openalex-snapshot
On Verification of Communicating Finite State Machines Using Residual Languages
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397284openalex-snapshot
Automated refinement checking of concurrent systems
inferred← citeshttps://doi.org/10.1109/icse.2015.265openalex-snapshot
Poster: Static Analysis of Concurrent Higher-Order Programs
inferred← citeshttps://doi.org/10.1109/icstw.2010.24openalex-snapshot
Searching for Safety Violations Using Estimation of Distribution Algorithms
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370520openalex-snapshot
Early Results with Precision Abstraction: Using Data-flow Analysis to Improve the Scalability of Model Checking
inferred← citeshttps://doi.org/10.1109/isads.2001.917397openalex-snapshot
On Godefroid's state-less search technique for testing concurrent programs
inferred← citeshttps://doi.org/10.1109/memcod.2005.1487901openalex-snapshot
Translation-based Co-verification
inferred← citeshttps://doi.org/10.1109/pdmc-hibi.2010.9openalex-snapshot
DiVinE: Parallel Distributed Model Checker
inferred← citeshttps://doi.org/10.1109/rtas.2012.34openalex-snapshot
Modeling Task Systems Using Parameterized Partial Orders
inferred← citeshttps://doi.org/10.1109/sefm.2010.35openalex-snapshot
Parallel Partial Order Reduction with Topological Sort Proviso
inferred← citeshttps://doi.org/10.1109/sies.2010.5551396openalex-snapshot
Context modelling and partial-order reduction: Application to SDL industrial embedded systems
inferred← citeshttps://doi.org/10.1109/syscon.2015.7116737openalex-snapshot
Digital system robustness via design constraints: The lesson of formal methods
inferred← citeshttps://doi.org/10.1109/tac.2021.3129161openalex-snapshot
Partial-Order Reduction for Supervisory Controller Synthesis
inferred← citeshttps://doi.org/10.1109/tcad.2010.2042889openalex-snapshot
Translation Validation of High-Level Synthesis
inferred← citeshttps://doi.org/10.1109/time.2001.930717openalex-snapshot
Deciding LTL over Mazurkiewicz traces
inferred← citeshttps://doi.org/10.1109/time.2001.930723openalex-snapshot
Modelling, specifying, and verifying message passing systems
inferred← citeshttps://doi.org/10.1109/tse.2011.1openalex-snapshot
Integer Linear Programming-Based Property Checking for Asynchronous Reactive Systems
inferred← citeshttps://doi.org/10.1109/tse.2013.18openalex-snapshot
Monitoring Data Usage in Distributed Systems
inferred← citeshttps://doi.org/10.1145/1065944.1065953openalex-snapshot
Static analysis of atomicity for programs with non-blocking synchronization
inferred← citeshttps://doi.org/10.1145/2001576.2001834openalex-snapshot
Finding short counterexamples in promela models using estimation of distribution algorithms
inferred← citeshttps://doi.org/10.1145/3477355.3477365openalex-snapshot
CSP: A Practical Process Algebra
inferred← citeshttps://doi.org/10.1145/3485496openalex-snapshot
Rewrite rule inference using equality saturation
inferred← citeshttps://doi.org/10.1145/3644033openalex-snapshot
Proceedings of the 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering (FormaliSE)
inferred← citeshttps://doi.org/10.23638/lmcs-17(1:21)2021openalex-snapshot
Stubborn Set Reduction for Two-Player Reachability Games
inferred← citeshttps://doi.org/10.32657/10356/72377openalex-snapshot
Parallelizing model checking algorithms using multi-core and many-core architectures
inferred← citeshttps://doi.org/10.3390/electronics13020463openalex-snapshot
An Efficient Reduction of Timer Interrupts for Model Checking of Embedded Assembly Programs
inferred← citeshttps://doi.org/10.4204/eptcs.72.1openalex-snapshot
Platform Dependent Verification: On Engineering Verification Tools for 21st Century
inferred← citeshttps://doi.org/10.54337/aau429765826openalex-snapshot
Time For Stubborn Game Reductions
inferred← citeshttps://doi.org/10.70675/5ae7fe22z0af7z4e8cza069zc101d0d6dc43openalex-snapshot
Variability-intensive applications over highly-configurable platforms : Early feasibility and optimality analysis
inferred← citeshttps://doi.org/10.70675/5e4b4b6fz230dz42cfza4a6zc332f27a1763openalex-snapshot
Quasi optimal model checking for concurrent systems
inferred← citeshttps://doi.org/10.70675/b8c9913aze055z43bdz863czb01f1010420fopenalex-snapshot
Automated Verification of Privacy in Security Protocols : Back and Forth Between Theory & Practice
inferred← citeshttps://doi.org/10.70675/d1665f85z72a6z4a2az9c53z2b249cdd4e7bopenalex-snapshot
Ρrise de décisiοn dans les systèmes à événements discrets en envirοnnement cοntraint et incertain
inferred← citeshttps://doi.org/10.7146/dpb.v29i546.7080openalex-snapshot
State Space Methods for Coloured Petri Nets
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.