On the public citation graph

A verified model checker for the modal Μ-calculus in Coq

https://doi.org/10.1007/bfb0054171
0 signed · 60 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-52148-8_6openalex-snapshot
Verifying properties of large sets of processes with network invariants
inferredcites →https://doi.org/10.1007/3-540-60045-0_40openalex-snapshot
Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving
inferredcites →https://doi.org/10.1007/3-540-60045-0_42openalex-snapshot
An integration of model checking with automated proof checking
inferredcites →https://doi.org/10.1007/3-540-60630-0_1openalex-snapshot
Combining model checking and deduction for I/O- automata
inferredcites →https://doi.org/10.1007/3-540-63533-5_23openalex-snapshot
Implementing a model checker for LEGO
inferredcites →https://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferredcites →https://doi.org/10.1007/bf01384313openalex-snapshot
Property preserving abstractions for the verification of concurrent systems
inferredcites →https://doi.org/10.1007/bfb0037116openalex-snapshot
Inductive definitions in the system Coq rules and properties
inferredcites →https://doi.org/10.1007/bfb0039057openalex-snapshot
A preorder for partial process specifications
inferredcites →https://doi.org/10.1016/0304-3975(91)90043-2openalex-snapshot
A note on model checking the modal ν-calculus
inferredcites →https://doi.org/10.1016/0304-3975(92)90183-gopenalex-snapshot
Local model checking for infinite state spaces
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/s0747-7171(06)80007-6openalex-snapshot
Synthesis of ML programs in the system Coq
inferredcites →https://doi.org/10.1017/cbo9781139032636openalex-snapshot
Lambda Calculus with Types
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0002openalex-snapshot
Lambda Calculi with Types
inferredcites →https://doi.org/10.1145/186025.186051openalex-snapshot
Model checking and abstraction
inferredcites →https://doi.org/10.1145/244795.244800openalex-snapshot
Abstract interpretation of reactive systems
inferredcites →https://doi.org/10.1145/72981.72998openalex-snapshot
A structural induction theorem for processes
inferredcites →https://doi.org/10.1145/75277.75285openalex-snapshot
Extracting ω's programs from proofs in the calculus of constructions
inferredcites →https://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties of Concurrent Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11603023_4openalex-snapshot
Automatic Verification of a Model Checker by Reflection
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_2openalex-snapshot
Certifying Model Checkers
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_15openalex-snapshot
Modelisation of Timed Automata in Coq
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_21openalex-snapshot
Formal Metatheory Using Implicit Syntax, and an Application to Data Abstraction for Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_14openalex-snapshot
Automated Verification of Parallel Nested DFS
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_24openalex-snapshot
Verified Certification of Reachability Checking for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-36709-0_2openalex-snapshot
Specification and Verification of a Linear-Time Temporal Logic for Graph Transformation
inferred← citeshttps://doi.org/10.1007/978-3-031-37703-7_11openalex-snapshot
CoqCryptoLine: A Verified Model Checker with Certified Results
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_17openalex-snapshot
Certifying Phase Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-032-27242-3_6openalex-snapshot
Imitation-Guided World Models for Multi-agent Train Rescheduling
inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_1openalex-snapshot
Liveness Proofs for Hardware Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-03077-7_3openalex-snapshot
Increasing Confidence in Liveness Model Checking Results with Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-07602-7_10openalex-snapshot
Formally Reasoning on a Reconfigurable Component-Based System — A Case Study for the Industrial World
inferred← citeshttps://doi.org/10.1007/978-3-319-19249-9_9openalex-snapshot
Certificates for Parameterized Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-19458-5_12openalex-snapshot
Automated Verification of Nested DFS
inferred← citeshttps://doi.org/10.1007/978-3-319-28934-2_13openalex-snapshot
Floating Time Transition System: More Efficient Analysis of Timed Actors
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_29openalex-snapshot
A Formalisation of Consistent Consequence for Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-89960-2_4openalex-snapshot
Verified Model Checking of Timed Automata
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-77505-8_25openalex-snapshot
Formalization of CTL* in Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_9openalex-snapshot
Modular Formalization of Reactive Modules in COQ
inferred← citeshttps://doi.org/10.1007/978-3-642-25318-8_26openalex-snapshot
A Proof Pearl with the Fan Theorem and Bar Induction
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_24openalex-snapshot
Verifying pCTL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-38613-8_9openalex-snapshot
Deductive Verification of State-Space Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_31openalex-snapshot
A Fully Verified Executable LTL Model Checker
inferred← citeshttps://doi.org/10.1007/bfb0055152openalex-snapshot
Case studies in meta-level theorem proving
inferred← citeshttps://doi.org/10.1007/s10703-005-2254-xopenalex-snapshot
Two Case Studies of Semantics Execution in Maude: CCS and LOTOS
inferred← citeshttps://doi.org/10.1007/s10766-013-0264-7openalex-snapshot
Bringing Coq into the World of GCM Distributed Applications
inferred← citeshttps://doi.org/10.1007/s10766-015-0360-yopenalex-snapshot
BSP-Why: A Tool for Deductive Verification of BSP Algorithms with Subgroup Synchronisation
inferred← citeshttps://doi.org/10.1007/s10817-018-9450-zopenalex-snapshot
Formally Verified Algorithms for Upper-Bounding State Space Diameters
inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101082openalex-snapshot
Counterpart-based Quantified Temporal Logics
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.09.008openalex-snapshot
Executable structural operational semantics in Maude
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80893-4openalex-snapshot
Puzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Testing Model Checkers
inferred← citeshttps://doi.org/10.1109/fmcad.2016.7886669openalex-snapshot
Proof certificates for SMT-based model checkers for infinite-state systems
inferred← citeshttps://doi.org/10.1109/pdcat.2012.93openalex-snapshot
Mechanised Verification of Distributed State-Space Algorithms for Security Protocols
inferred← citeshttps://doi.org/10.1109/tase49443.2020.00023openalex-snapshot
Formalizing the Soundness of the Encoding Methods of SAT-based Model Checking
inferred← citeshttps://doi.org/10.1145/1141277.1141694openalex-snapshot
Modeling and analyzing applications with domain-specific languages by reflective rewriting
inferred← citeshttps://doi.org/10.1145/3756907.3756912openalex-snapshot
Formalizing Weighted Pushdown Systems in Isabelle/HOL
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d80openalex-snapshot
Automated Verification of Parallel Nested DFS
inferred← citeshttps://doi.org/10.70675/5e0f5705z8360z4a62zb884z5db7671051c1openalex-snapshot
A mechanized theory of regular trees in dependent type theory
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.