On the public citation graph

Practical model-checking using games

https://doi.org/10.1007/bfb0054166
0 signed · 74 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-56922-7_32openalex-snapshot
On model-checking for fragments of μ-calculus
inferredcites →https://doi.org/10.1007/3-540-58179-0_50openalex-snapshot
An automata-theoretic approach to branching-time model checking (Extended abstract)
inferredcites →https://doi.org/10.1007/3-540-58179-0_66openalex-snapshot
An improved algorithm for the evaluation of fixpoint expressions
inferredcites →https://doi.org/10.1007/3-540-60218-6_1openalex-snapshot
Local model checking games (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-60915-6_5openalex-snapshot
Modal and temporal logics for processes
inferredcites →https://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1016/0304-3975(94)90266-6openalex-snapshot
Model checking and boolean graphs
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11691617_8openalex-snapshot
Distributed On-the-Fly Model Checking and Test Case Generation
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_2openalex-snapshot
Certifying Model Checkers
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_24openalex-snapshot
Truth/SLC — A Parallel Verification Platform for Concurrent Systems
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_6openalex-snapshot
On Expressive and Model Checking Power of Propositional Program Logics
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_37openalex-snapshot
Evidence-Based Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_20openalex-snapshot
Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_18openalex-snapshot
Efficient Diagnostic Generation for Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_6openalex-snapshot
Model Checking Games for the Alternation-Free μ-Calculus and Alternating Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_12openalex-snapshot
Cheap CTL Compassion in NuSMV
inferred← citeshttps://doi.org/10.1007/978-3-031-06773-0_30openalex-snapshot
On-the-Fly Model Checking with Neural MCTS
inferred← citeshttps://doi.org/10.1007/978-3-031-50524-9_8openalex-snapshot
Generic Model Checking for Modal Fixpoint Logics in COOL-MC
inferred← citeshttps://doi.org/10.1007/978-3-032-08064-6_4openalex-snapshot
A Logic for Resource-Sensitive Coalition Games
inferred← citeshttps://doi.org/10.1007/978-3-319-24644-4_9openalex-snapshot
Benchmarks for Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-319-39570-8_10openalex-snapshot
Branching Bisimulation Games
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_9openalex-snapshot
Automata for True Concurrency Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_14openalex-snapshot
MetaGame: An Animation Tool for Model-Checking Games
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_44openalex-snapshot
PlayGame: A Platform for Diagnostic Games
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_5openalex-snapshot
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_7openalex-snapshot
Symbolic Model Checking of Non-regular Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_28openalex-snapshot
Generating Counterexamples for Multi-valued Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-70889-6_7openalex-snapshot
Model-Driven Development with the jABC
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_15openalex-snapshot
Solving Parity Games in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_28openalex-snapshot
A Decision Procedure for CTL* Based on Tableaux and Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-18090-3_16openalex-snapshot
Logiken auf unendlichen Bäumen
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_33openalex-snapshot
CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_16openalex-snapshot
Stuttering Mostly Speeds Up Solving Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-642-41488-6_17openalex-snapshot
Incremental Hyperproperty Model Checking via Games
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/bfb0055621openalex-snapshot
Abstract games for infinite state processes
inferred← citeshttps://doi.org/10.1007/s00236-017-0301-xopenalex-snapshot
Parity game reductions
inferred← citeshttps://doi.org/10.1007/s10009-005-0194-9openalex-snapshot
CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems
inferred← citeshttps://doi.org/10.1007/s10009-011-0221-yopenalex-snapshot
Debugging formal specifications: a practical approach using model-based diagnosis and counterstrategies
inferred← citeshttps://doi.org/10.1007/s10009-012-0244-zopenalex-snapshot
CADP 2011: a toolbox for the construction and analysis of distributed processes
inferred← citeshttps://doi.org/10.1007/s10849-009-9088-7openalex-snapshot
Model Checking for Hybrid Logic
inferred← citeshttps://doi.org/10.1007/s12652-013-0209-4openalex-snapshot
Design-time formal verification for smart environments: an exploratory perspective
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.007openalex-snapshot
A superpolynomial lower bound for strategy iteration based on snare memorization
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.04.008openalex-snapshot
A Solver for Modal Fixpoint Logics
inferred← citeshttps://doi.org/10.1016/j.ic.2006.05.001openalex-snapshot
The alternation hierarchy in fixpoint logic with chop is strict too
inferred← citeshttps://doi.org/10.1016/j.ic.2010.12.002openalex-snapshot
Model-checking games for fixpoint logics with partial order models
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.1051/ita/2011124openalex-snapshot
Recursive algorithm for parity games requires exponential time
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351127openalex-snapshot
Debugging formal specifications using simple counterstrategies
inferred← citeshttps://doi.org/10.1109/lics.2009.27openalex-snapshot
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
inferred← citeshttps://doi.org/10.1109/tase.2014.24openalex-snapshot
An Improved Recursive Algorithm for Parity Games
inferred← citeshttps://doi.org/10.1109/tse.2003.1237171openalex-snapshot
Temporal logic query checking: a tool for model exploration
inferred← citeshttps://doi.org/10.1142/s0129054110007246openalex-snapshot
THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME
inferred← citeshttps://doi.org/10.1142/s0129054112400333openalex-snapshot
TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING
inferred← citeshttps://doi.org/10.1145/2071368.2071376openalex-snapshot
Structural Analysis of Boolean Equation Systems
inferred← citeshttps://doi.org/10.1145/3290339openalex-snapshot
Fixpoint games on continuous lattices
inferred← citeshttps://doi.org/10.17760/d20467228openalex-snapshot
Persephone: a Framework for applying neural MCTS to model checking and mathematical puzzles through recursive-FOL based semantic games
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:23)2011openalex-snapshot
An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:15)2017openalex-snapshot
Games for Bisimulations and Abstraction
inferred← citeshttps://doi.org/10.3166/tsi.22.461-495openalex-snapshot
Logiques temporelles basées sur actions pour la vérification des systèmes asynchrones
inferred← citeshttps://doi.org/10.3233/jid-2013-0022openalex-snapshot
Simplifying Translation Validation via Model Extrapolation
inferred← citeshttps://doi.org/10.4204/eptcs.193.12openalex-snapshot
Improvement in Small Progress Measures
inferred← citeshttps://doi.org/10.4204/eptcs.77.6openalex-snapshot
Model-Checking the Higher-Dimensional Modal mu-Calculus
inferred← citeshttps://doi.org/10.4204/eptcs.78.4openalex-snapshot
Rich Counter-Examples for Temporal-Epistemic Logic Model Checking
inferred← citeshttps://doi.org/10.4230/lipics.concur.2020.25openalex-snapshot
Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations
inferred← citeshttps://doi.org/10.48550/arxiv.0901.2731openalex-snapshot
A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it
inferred← citeshttps://doi.org/10.48550/arxiv.1011.1172openalex-snapshot
Logics and Games for True Concurrency
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2366openalex-snapshot
Stuttering Equivalence for Parity Games
inferred← citeshttps://doi.org/10.48550/arxiv.1407.2149openalex-snapshot
Strategy Derivation for Small Progress Measures
inferred← citeshttps://doi.org/10.48550/arxiv.1407.3121openalex-snapshot
Benchmarks for Parity Games (extended version)
inferred← citeshttps://doi.org/10.5282/edoc.13294openalex-snapshot
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
inferred← citeshttps://doi.org/10.6100/ir757862openalex-snapshot
Advanced reduction techniques for model checking
inferred← citeshttps://doi.org/10.7146/brics.v14i13.22178openalex-snapshot
Temporal Logics Beyond Regularity
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.