On the public citation graph

A note on model checking the modal v-calculus

https://doi.org/10.1007/bfb0035797
0 signed · 35 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-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10930755_11openalex-snapshot
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_32openalex-snapshot
Distributed Symbolic Model Checking for μ-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_135openalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_4openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_1openalex-snapshot
Model checking and boolean graphs
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_93openalex-snapshot
Fixed points of Büchi automata
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_4openalex-snapshot
Efficient local correctness checking
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_18openalex-snapshot
Model construction for implicit specifications in modal logic
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_2openalex-snapshot
On model checking infinite-state systems
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_66openalex-snapshot
An improved algorithm for the evaluation of fixpoint expressions
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_50openalex-snapshot
Toward a modal theory of types for the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_23openalex-snapshot
Implementing a model checker for LEGO
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_7openalex-snapshot
Behavioral and Spatial Observations in a Logic for the π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-30579-8_16openalex-snapshot
Don’t Know in the μ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-45210-2_26openalex-snapshot
On the Strong Co–induction in Coq
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_31openalex-snapshot
Testing-Based Abstractions for Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-76562-9_13openalex-snapshot
Computer Aided Verification of Parallel Processes
inferred← citeshttps://doi.org/10.1007/bf00709155openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferred← citeshttps://doi.org/10.1007/bfb0032056openalex-snapshot
Compositionality through an operational semantics of contexts
inferred← citeshttps://doi.org/10.1007/bfb0039055openalex-snapshot
Verifying temporal properties of processes
inferred← citeshttps://doi.org/10.1007/bfb0054161openalex-snapshot
Fully local and efficient evaluation of alternating fixed points
inferred← citeshttps://doi.org/10.1007/bfb0084787openalex-snapshot
Model checking for context-free processes
inferred← citeshttps://doi.org/10.1007/s10703-005-1493-1openalex-snapshot
Distributed Symbolic Model Checking for μ-Calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2006.10.009openalex-snapshot
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.007openalex-snapshot
Complete proof systems for weighted modal logic
inferred← citeshttps://doi.org/10.1109/hicss.1993.284112openalex-snapshot
Model checking of control-finite CSP programs
inferred← citeshttps://doi.org/10.1109/icci.1992.227708openalex-snapshot
Linear local and global model checking algorithms for a kernal temporal logic language
inferred← citeshttps://doi.org/10.1109/lics.1996.561358openalex-snapshot
Efficient model checking via the equational μ-calculus
inferred← citeshttps://doi.org/10.1145/3622786openalex-snapshot
Extensible Proof Systems for Infinite-State 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.