On the public citation graph

Static partial order reduction

0 signed · 98 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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-61550-4_141openalex-snapshot

Partial order reduction: Model-checking using representatives

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/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.1016/0196-6774(82)90023-2openalex-snapshot

An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

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.1090/dimacs/003/04openalex-snapshot

A stubborn attack on state explosion

inferredcites →https://doi.org/10.1109/43.662676openalex-snapshot

Formal verification of digital systems by automatic reduction of data paths

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/pccc.1992.200529openalex-snapshot

A fast protocol conversion technique using reduction of state transition graphs

inferredcites →https://doi.org/10.1142/9789812389701_0011openalex-snapshot

FORMAL DESCRIPTION TECHNIQUES

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.1515/9781400864041openalex-snapshot

Computer-Aided Verification of Coordinating Processes

inferredcites →https://doi.org/10.7551/mitpress/6874.001.0001openalex-snapshot

Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/bltj.10082openalex-snapshot

Recent Lucent Technologies Patents

inferred← citeshttps://doi.org/10.1007/11537328_10openalex-snapshot

Improving Spin’s Partial-Order Reduction for Breadth-First Search

inferred← citeshttps://doi.org/10.1007/11560548_25openalex-snapshot

Symbolic Partial Order Reduction for Rule Based Transition Systems

inferred← citeshttps://doi.org/10.1007/11576280_26openalex-snapshot

A Static Communication Elimination Algorithm for Distributed System Verification

inferred← citeshttps://doi.org/10.1007/11691617_16openalex-snapshot

Partial-Order Reduction for General State Exploring Algorithms

inferred← citeshttps://doi.org/10.1007/11784180_13openalex-snapshot

State Space Reduction of Rewrite Theories Using Invisible Transitions

inferred← citeshttps://doi.org/10.1007/11817963_28openalex-snapshot

Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions

inferred← citeshttps://doi.org/10.1007/11944836_29openalex-snapshot

On Reduction Criteria for Probabilistic Reward Models

inferred← citeshttps://doi.org/10.1007/3-540-44585-4_36openalex-snapshot

SDLcheck: A Model Checking Tool

inferred← citeshttps://doi.org/10.1007/3-540-44829-2_4openalex-snapshot

Distributed Explicit Fair Cycle Detection (Set Based Approach)

inferred← citeshttps://doi.org/10.1007/3-540-45657-0_48openalex-snapshot

Compressing Transitions for Model Checking

inferred← citeshttps://doi.org/10.1007/3-540-45923-5_24openalex-snapshot

ObjectCheck: A Model Checking Tool for Executable Object-Oriented Software System Designs

inferred← citeshttps://doi.org/10.1007/3-540-45923-5_5openalex-snapshot

Integrated State Space Reduction for Model Checking Executable Object-Oriented Software System Designs

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/3-540-46419-0_19openalex-snapshot

Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems

inferred← citeshttps://doi.org/10.1007/3-540-48153-2_24openalex-snapshot

Hazard—Freedom Checking in Speed—Independent Systems

inferred← citeshttps://doi.org/10.1007/3-540-48294-6_11openalex-snapshot

State Space Reduction Based on Live Variables Analysis

inferred← citeshttps://doi.org/10.1007/978-0-387-35578-8_14openalex-snapshot

An Optimizing Compiler for Efficient Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_19openalex-snapshot

Experimenting with Stubborn Sets on Petri Nets

inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_6openalex-snapshot

Partial-Order Reduction

inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_20openalex-snapshot

Partial-Order Reduction for Multi-core LTL Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-319-40648-0_23openalex-snapshot

Formal Verification of an Executable LTL Model Checker with Partial Order Reduction

inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_26openalex-snapshot

BFS-Based Model Checking of Linear-Time Properties with an Application on GPUs

inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_14openalex-snapshot

Dynamic Reductions for Model Checking Concurrent Software

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-540-24721-0_24openalex-snapshot

Translating Software Designs for Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_37openalex-snapshot

Improving the Consistency Checking Process by Reusing Formal Verification Knowledge

inferred← citeshttps://doi.org/10.1007/978-3-540-45064-1_15openalex-snapshot

Reuse of Formal Verification Efforts of Incomplete Models at the Requirements Specification Stage

inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_40openalex-snapshot

To Store or Not to Store

inferred← citeshttps://doi.org/10.1007/978-3-540-73370-6_7openalex-snapshot

Some Solutions to the Ignoring Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-03240-0_9openalex-snapshot

Efficient Symbolic Model Checking for Process Algebras

inferred← citeshttps://doi.org/10.1007/978-3-642-12029-9_18openalex-snapshot

An Automata-Theoretic Approach to Hardware/Software Co-verification

inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_30openalex-snapshot

Efficient Reachability Analysis of Büchi Pushdown Systems for Hardware/Software Co-verification

inferred← citeshttps://doi.org/10.1007/978-3-642-19811-3_11openalex-snapshot

Model Checking Büchi Pushdown Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_29openalex-snapshot

Combining Partial-Order Reduction and Symbolic Model Checking to Verify LTL Properties

inferred← citeshttps://doi.org/10.1007/978-3-642-59615-5_9openalex-snapshot

Partial Order Reductions

inferred← citeshttps://doi.org/10.1007/978-3-662-54580-5openalex-snapshot

Tools and Algorithms for the Construction and Analysis of Systems

inferred← citeshttps://doi.org/10.1007/bfb0028727openalex-snapshot

Ten years of partial order reduction

inferred← citeshttps://doi.org/10.1007/bfb0028760openalex-snapshot

A general approach to partial order reductions in symbolic verification

inferred← citeshttps://doi.org/10.1007/s00236-009-0111-xopenalex-snapshot

Symmetry and partial order reduction techniques in model checking Rebeca

inferred← citeshttps://doi.org/10.1007/s00236-014-0203-0openalex-snapshot

Formal communication elimination and sequentialization equivalence proofs for distributed system models

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-008-0093-yopenalex-snapshot

Partial-order reduction for general state exploring algorithms

inferred← citeshttps://doi.org/10.1007/s10009-010-0137-yopenalex-snapshot

Solving the ignoring problem for partial order reduction

inferred← citeshttps://doi.org/10.1007/s10817-017-9418-4openalex-snapshot

Formal Verification of an Executable LTL Model Checker with Partial Order Reduction

inferred← citeshttps://doi.org/10.1007/s11390-011-9421-xopenalex-snapshot

NuMDG: A New Tool for Multiway Decision Graphs Construction

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.034openalex-snapshot

Partial Order Reduction for Probabilistic Branching Time

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.05.038openalex-snapshot

Formal Sequentialization of Distributed Systems via Program Rewriting

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.06.008openalex-snapshot

Partial Order Reduction for Rewriting Semantics of Programming Languages

inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.008openalex-snapshot

Tool Support for Holistic Modelling of Distributed Embedded Systems in Creol

inferred← citeshttps://doi.org/10.1016/j.scico.2011.03.001openalex-snapshot

On-the-fly parallel model checking algorithm that is optimal for verification of weak LTL properties

inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00133-8openalex-snapshot

State space reduction based on live variables analysis

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80485-7openalex-snapshot

Implied Scenario Detection in the Presence of Behaviour Constraints

inferred← citeshttps://doi.org/10.1023/a:1020383505582openalex-snapshot

Combining Software and Hardware Verification Techniques

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.1023/b:form.0000040029.73127.85openalex-snapshot

Lessons Learned from Model Checking a NASA Robot Controller

inferred← citeshttps://doi.org/10.1109/43.771173openalex-snapshot

Accelerating Markovian analysis of asynchronous systems using state compression

inferred← citeshttps://doi.org/10.1109/access.2019.2948986openalex-snapshot

Maximal Good Step Graph Methods for Reducing the Generation of the State Space

inferred← citeshttps://doi.org/10.1109/apsec.2004.28openalex-snapshot

An Improved Repository System for Effective and Efficient Reuse of Formal Verification Efforts

inferred← citeshttps://doi.org/10.1109/ase.2001.989823openalex-snapshot

Model checking for an executable subset of UML

inferred← citeshttps://doi.org/10.1109/icse.2013.6606566openalex-snapshot

Detecting spurious counterexamples efficiently in abstract model checking

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/jproc.2004.831197openalex-snapshot

Formal verification of timed systems: a survey and perspective

inferred← citeshttps://doi.org/10.1109/memcod.2005.1487901openalex-snapshot

Translation-based Co-verification

inferred← citeshttps://doi.org/10.1109/qest.2004.1348037openalex-snapshot

Partial order reduction for probabilistic systems

inferred← citeshttps://doi.org/10.1109/qest.2004.30openalex-snapshot

Partial order reduction for probabilistic systems

inferred← citeshttps://doi.org/10.1109/qest.2008.45openalex-snapshot

Reduction Techniques for Model Checking Markov Decision Processes

inferred← citeshttps://doi.org/10.1109/qest.2012.22openalex-snapshot

Static Partial Order Reduction for Probabilistic Concurrent Systems

inferred← citeshttps://doi.org/10.1109/sefm.2010.35openalex-snapshot

Parallel Partial Order Reduction with Topological Sort Proviso

inferred← citeshttps://doi.org/10.1109/tse.2007.70724openalex-snapshot

The Design of a Multicore Extension of the SPIN Model Checker

inferred← citeshttps://doi.org/10.1109/tse.2012.82openalex-snapshot

Verifying Linearizability via Optimized Refinement Checking

inferred← citeshttps://doi.org/10.1109/tse.2014.2357442openalex-snapshot

Making CEGAR More Efficient in Software Model Checking

inferred← citeshttps://doi.org/10.1145/1375581.1375625openalex-snapshot

Fair stateless model checking

inferred← citeshttps://doi.org/10.1145/1453101.1453127openalex-snapshot

Modular verification of web services using efficient symbolic encoding and summarization

inferred← citeshttps://doi.org/10.1145/2557833.2560581openalex-snapshot

Vector-clock based partial order reduction for JPF

inferred← citeshttps://doi.org/10.1145/3332466.3374529openalex-snapshot

Parallel and distributed bounded model checking of multi-threaded programs

inferred← citeshttps://doi.org/10.1145/3763136openalex-snapshot

MIO: Multiverse Debugging in the Face of Input/Output

inferred← citeshttps://doi.org/10.15760/etd.12openalex-snapshot

An Automata-Theoretic Approach to Hardware/Software Co-verification

inferred← citeshttps://doi.org/10.5555/2486788.2486816openalex-snapshot

Detecting spurious counterexamples efficiently in abstract model checking

inferred← citeshttps://doi.org/10.5555/380921.380937openalex-snapshot

p2b: a translation utility for linking promela and symbolic model checking (tool paper)

inferred← citeshttps://doi.org/10.6100/ir635700openalex-snapshot

Formal methods in support of SMC design

inferred← citeshttps://doi.org/10.70675/f5fc5032zc27dz4fffza3cbzd9a01566f10dopenalex-snapshot

Partial order reduction for timed systems

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.