On the public citation graph

Structural symmetry and model checking

0 signed · 33 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-60045-0_59openalex-snapshot
Utilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach
inferredcites →https://doi.org/10.1007/3-540-63166-6_24openalex-snapshot
On-the-fly model checking under fairness that exploits symmetry
inferredcites →https://doi.org/10.1007/3-540-63166-6_25openalex-snapshot
Exploiting symmetry when verifying transistor-level circuits by symbolic trajectory evaluation
inferredcites →https://doi.org/10.1007/bf00625968openalex-snapshot
Better verification through symmetry
inferredcites →https://doi.org/10.1007/bf00625969openalex-snapshot
Exploiting symmetry in temporal logic model checking
inferredcites →https://doi.org/10.1007/bf00625970openalex-snapshot
Symmetry and model checking
inferredcites →https://doi.org/10.1007/bfb0035378openalex-snapshot
Combining partial order and symmetry reductions
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50015-1openalex-snapshot
Graph Algorithms
inferredcites →https://doi.org/10.1016/s0004-3702(83)80012-5openalex-snapshot
Efficient graph automorphism by vertex partitioning
inferredcites →https://doi.org/10.1109/43.275352openalex-snapshot
Symbolic model checking for sequential circuit verification
inferredcites →https://doi.org/10.1109/sfcs.1996.548501openalex-snapshot
The Boolean isomorphism problem
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-48153-2_19openalex-snapshot
Hints to Accelerate Symbolic Traversal
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/s10472-010-9208-8openalex-snapshot
Efficient approximate verification of B and Z models via symmetry markers
inferred← citeshttps://doi.org/10.1007/s10559-010-9235-9openalex-snapshot
An automatic method for the dynamic construction of abstractions of states of a formal model
inferred← citeshttps://doi.org/10.1007/s10703-011-0119-zopenalex-snapshot
Exploring structural symmetry automatically in symbolic trajectory evaluation
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.09.007openalex-snapshot
Spin-to-Grape: A Tool for Analysing Symmetry in Promela Models
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.11.006openalex-snapshot
An invariant-based approach to the verification of asynchronous parameterized networks
inferred← citeshttps://doi.org/10.1023/a:1016372507161openalex-snapshot
Specification, Validation, and Synthesis of Email Agent Controllers: A Case Study in Function Rich Reactive System Design
inferred← citeshttps://doi.org/10.1109/dac.2002.1012719openalex-snapshot
Solving difficult SAT instances in the presence of symmetry
inferred← citeshttps://doi.org/10.1109/iccd.2003.1240946openalex-snapshot
Structural detection of symmetries in Boolean functions
inferred← citeshttps://doi.org/10.1109/iccd.2006.4380826openalex-snapshot
Scalable Sequential Equivalence Checking across Arbitrary Design Transformations
inferred← citeshttps://doi.org/10.1109/tcad.2003.816218openalex-snapshot
Solving difficult instances of boolean satisfiability in the presence of symmetry
inferred← citeshttps://doi.org/10.1145/1132960.1132962openalex-snapshot
Symmetry in temporal logic model checking
inferred← citeshttps://doi.org/10.1145/349360.351126openalex-snapshot
Specification, validation, and synthesis of email agent controllers
inferred← citeshttps://doi.org/10.1145/513918.514102openalex-snapshot
Solving difficult SAT instances in the presence of symmetry
inferred← citeshttps://doi.org/10.15589/znp2020.1(479)openalex-snapshot
inferred← citeshttps://doi.org/10.15589/znp2020.1(479).10openalex-snapshot
A SURVEY OF PARAMETRIC MODEL VERIFICATION METHODS
inferred← citeshttps://doi.org/10.2200/s00257ed1v01y201002dcs027openalex-snapshot
Digital System Verification: A Combined Formal Methods and Simulation Framework
inferred← citeshttps://doi.org/10.3103/s0146411610070035openalex-snapshot
On application of weaker simulations to parameterized model checking by network invariants technique
inferred← citeshttps://doi.org/10.3233/fi-1999-37305openalex-snapshot
Finding Symmetries of Algebraic System Nets
inferred← citeshttps://doi.org/10.5555/1874620.1875020openalex-snapshot
Speculative reduction-based scalable redundancy identification
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.