On the public citation graph
From pre-historic to post-modern symbolic model checking
0 signed · 63 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.1092openalex-snapshot
Reasoning about Infinite Computations
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-55179-4_6openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferredcites →https://doi.org/10.1007/3-540-56496-9_32openalex-snapshot
Faster model checking for the modal Mu-Calculus
inferredcites →https://doi.org/10.1007/3-540-58043-3_19openalex-snapshot
Verification tools for finite-state concurrent systems
inferredcites →https://doi.org/10.1007/3-540-58179-0_69openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferredcites →https://doi.org/10.1007/3-540-58179-0_72openalex-snapshot
Another look at LTL model checking
inferredcites →https://doi.org/10.1007/3-540-61474-5_86openalex-snapshot
The Mur ϕ verification system
inferredcites →https://doi.org/10.1007/3-540-61474-5_95openalex-snapshot
VIS: A system for verification and synthesis
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/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/bfb0013029openalex-snapshot
Expressibility results for linear-time and branching-time logics
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0055090openalex-snapshot
Reasoning about the past with two-way automata
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
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(94)90269-0openalex-snapshot
CTL∗ and ECTL∗ as fragments of the modal μ-calculus
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1109/iccad.1996.569084openalex-snapshot
CTL model checking based on forward state traversal
inferredcites →https://doi.org/10.1109/iccad.1997.643567openalex-snapshot
Forward model checking techniques oriented to buggy designs
inferredcites →https://doi.org/10.1109/lics.1995.523241openalex-snapshot
Once and for all [temporal logic]
inferredcites →https://doi.org/10.1109/lics.1996.561358openalex-snapshot
Efficient model checking via the equational μ-calculus
inferredcites →https://doi.org/10.1109/lics.1998.705645openalex-snapshot
Freedom, weakness, and determinism: 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.5555/244522.244536openalex-snapshot
CTL model checking based on forward state traversal
inferredcites →https://doi.org/10.5555/266388.266515openalex-snapshot
Forward model checking techniques oriented to buggy designs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722167_17openalex-snapshot
Detecting Errors Before Reaching Them
inferred← citeshttps://doi.org/10.1007/3-540-32062-8_25openalex-snapshot
From Testing to Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_31openalex-snapshot
Model Checking the World Wide Web?
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_7openalex-snapshot
A Practical Approach to Coverage in Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44914-0_1openalex-snapshot
Partial Completeness of Abstract Fixpoint Checking
inferred← citeshttps://doi.org/10.1007/3-540-44978-7_7openalex-snapshot
Combining Forward And Backward Analyses of Temporal Properties
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_29openalex-snapshot
Is There a Best Symbolic Cycle-Detection Algorithm?
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_10openalex-snapshot
Accurate Widenings and Boundedness Properties of Timed Systems
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_8openalex-snapshot
Dihomotopy as a Tool in State Space Analysis Tutorial
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_18openalex-snapshot
Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_8openalex-snapshot
Multiple State and Single State Tableaux for Combining Local and Global Nodel Checking
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_21openalex-snapshot
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
inferred← citeshttps://doi.org/10.1007/3-540-49163-5_3openalex-snapshot
On Hybrid Systems and the Modal µ-calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_31openalex-snapshot
Symbolic Model Checking in Non-Boolean Domains
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_19openalex-snapshot
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_6openalex-snapshot
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-03092-5_5openalex-snapshot
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
inferred← citeshttps://doi.org/10.1007/s10009-003-0121-xopenalex-snapshot
Efficient reduction of finite state model checking to reachability analysis
inferred← citeshttps://doi.org/10.1007/s10009-004-0183-4openalex-snapshot
A survey of recent advances in SAT-based formal verification
inferred← citeshttps://doi.org/10.1007/s10703-017-0277-8openalex-snapshot
On relative and probabilistic finite counterability
inferred← citeshttps://doi.org/10.1016/b978-0-12-370616-4.x5001-0openalex-snapshot
Verification Techniques for System-Level Design
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80410-9openalex-snapshot
Liveness Checking as Safety Checking
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80667-4openalex-snapshot
Combining Local and Global Model Checking
inferred← citeshttps://doi.org/10.1023/a:1016091902809openalex-snapshot
Bisimulation Minimization and Symbolic Model Checking
inferred← citeshttps://doi.org/10.1109/access.2022.3143478openalex-snapshot
Generating and Employing Witness Automata for ACTLW Formulae
inferred← citeshttps://doi.org/10.1109/time.2013.15openalex-snapshot
Extracting Unsatisfiable Cores for LTL via Temporal Resolution
inferred← citeshttps://doi.org/10.14232/actacyb.22.3.2016.2openalex-snapshot
Improving Saturation-based Bounded Model Checking
inferred← citeshttps://doi.org/10.3929/ethz-a-005170555openalex-snapshot
Liveness checking as safety checking to find shortest counterexamples to linear time properties
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.