On the public citation graph
Yasm: A Software Model-Checker for Verification and Refutation
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.
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.1007/11513988_7openalex-snapshot
Concrete Model Checking with Abstract Matching and Refinement
inferredcites →https://doi.org/10.1007/11691372_14openalex-snapshot
Why Waste a Perfectly Good Abstraction?
inferredcites →https://doi.org/10.1007/3-540-44685-0_29openalex-snapshot
Abstraction-Based Model Checking Using Modal Transition Systems
inferredcites →https://doi.org/10.1007/3-540-45319-9_19openalex-snapshot
Boolean and Cartesian Abstraction for Model Checking C Programs
inferredcites →https://doi.org/10.1007/3-540-45657-0_41openalex-snapshot
ΧChek: A Multi-valued Model-Checker
inferredcites →https://doi.org/10.1007/3-540-45937-5_16openalex-snapshot
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_40openalex-snapshot
Monotonic Abstraction-Refinement for CTL
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_49openalex-snapshot
CVC Lite: A New Implementation of the Cooperating Validity Checker
inferredcites →https://doi.org/10.1007/978-3-540-31984-9_17openalex-snapshot
A Framework for Counterexample Generation and Exploration
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_28openalex-snapshot
A Game-Based Framework for CTL Counterexamples and 3-Valued Abstraction-Refinement
inferredcites →https://doi.org/10.1007/s10009-007-0047-9openalex-snapshot
A framework for counterexample generation and exploration
inferredcites →https://doi.org/10.1109/lics.2004.1319628openalex-snapshot
The existence of finite abstractions for branching time model checking
inferredcites →https://doi.org/10.1109/lics.2004.42openalex-snapshot
The existence of finite abstractions for branching time model checking
inferredcites →https://doi.org/10.1145/1297658.1297659openalex-snapshot
A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
inferredcites →https://doi.org/10.1145/244795.244800openalex-snapshot
Abstract interpretation of reactive systems
inferredcites →https://doi.org/10.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferredcites →https://doi.org/10.1145/990010.990011openalex-snapshot
Multi-valued symbolic 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/978-3-030-67067-2_14openalex-snapshot
Unbounded Procedure Summaries from Bounded Environments
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_36openalex-snapshot
Pre-deployment Security Assessment for Cloud Services Through Semantic Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-032-15700-3_12openalex-snapshot
Input-Based Three-Valued Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-29473-5_2openalex-snapshot
Instantiation Reduction in Iterative Parameterised Three-Valued Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_3openalex-snapshot
30 Years of Modal Transition Systems: Survey of Extensions and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-99725-4_24openalex-snapshot
Abstract Interpretation of CTL Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_9openalex-snapshot
Model Checking Recursive Programs with Exact Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_28openalex-snapshot
Mixed Transition Systems Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_26openalex-snapshot
Temporal Property Verification as a Program Analysis Task
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_12openalex-snapshot
Statically Validating Must Summaries for Incremental Compositional Dynamic Test Generation
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_4openalex-snapshot
Whale: An Interpolation-Based Algorithm for Inter-procedural Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_16openalex-snapshot
Analysis of Boolean Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_25openalex-snapshot
Counterexample-Guided Precondition Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_11openalex-snapshot
Proving Nontermination via Safety
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_29openalex-snapshot
Bonsai: Cutting Models Down to Size
inferred← citeshttps://doi.org/10.1007/s00354-009-0116-6openalex-snapshot
Paraconsistent Computation Tree Logic
inferred← citeshttps://doi.org/10.1007/s00607-012-0215-yopenalex-snapshot
Monitoring and recovery for web service applications
inferred← citeshttps://doi.org/10.1007/s10703-008-0053-xopenalex-snapshot
Verification of evolving software via component substitutability analysis
inferred← citeshttps://doi.org/10.1007/s10703-012-0153-5openalex-snapshot
Temporal property verification as a program analysis task
inferred← citeshttps://doi.org/10.1007/s10849-022-09386-7openalex-snapshot
Falsification-Aware Calculi and Semantics for Normal Modal Logics Including S4 and S5
inferred← citeshttps://doi.org/10.1007/s10992-021-09611-xopenalex-snapshot
Falsification-Aware Semantics and Sequent Calculi for Classical Logic
inferred← citeshttps://doi.org/10.1007/s11225-023-10052-7openalex-snapshot
Refutation-Aware Gentzen-Style Calculi for Propositional Until-Free Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.04.032openalex-snapshot
A meta-heuristic solution for automated refutation of complex software systems specified through graph transformations
inferred← citeshttps://doi.org/10.1016/j.asoc.2016.06.039openalex-snapshot
EMCDM: Efficient model checking by data mining for verification of complex software systems specified through architectural styles
inferred← citeshttps://doi.org/10.1016/j.ic.2010.08.001openalex-snapshot
On the consistency, expressiveness, and precision of partial modeling formalisms
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.12.004openalex-snapshot
System-level state equality detection for the formal dynamic verification of legacy distributed applications
inferred← citeshttps://doi.org/10.1017/s0960129509990260openalex-snapshot
Modal and mixed specifications: key decision problems and their complexities
inferred← citeshttps://doi.org/10.1109/acsd.2015.18openalex-snapshot
Multi-valued Abstraction Using Lattice Operations
inferred← citeshttps://doi.org/10.1109/ase.2008.55openalex-snapshot
Augmenting Counterexample-Guided Abstraction Refinement with Proof Templates
inferred← citeshttps://doi.org/10.1109/ase.2008.80openalex-snapshot
PtYasm: Software Model Checking with Proof Templates
inferred← citeshttps://doi.org/10.1109/fmcad.2014.6987597openalex-snapshot
Disproving termination with overapproximation
inferred← citeshttps://doi.org/10.1109/fmcad.2014.6987598openalex-snapshot
Faster temporal reasoning for infinite-state programs
inferred← citeshttps://doi.org/10.1109/pdp.2015.95openalex-snapshot
System-Level State Equality Detection for the Formal Dynamic Verification of Legacy Distributed Applications
inferred← citeshttps://doi.org/10.1109/tase.2014.18openalex-snapshot
Mixed Simulation of Multi-valued Models
inferred← citeshttps://doi.org/10.1109/wetice57085.2023.10477788openalex-snapshot
HYASM: A Tool to Verify Hierarchical Systems
inferred← citeshttps://doi.org/10.1142/s0218194022500371openalex-snapshot
Falsification-Aware Semantics for Temporal Logics and Their Inconsistency-Tolerant Subsystems: Theoretical Foundations of Falsification-Aware Model Checking
inferred← citeshttps://doi.org/10.1145/1321631.1321719openalex-snapshot
Model checking concurrent linux device drivers
inferred← citeshttps://doi.org/10.1145/1706299.1706307openalex-snapshot
Compositional may-must program analysis
inferred← citeshttps://doi.org/10.1145/1707801.1706307openalex-snapshot
Compositional may-must program analysis
inferred← citeshttps://doi.org/10.1145/2491956.2491969openalex-snapshot
Reasoning about nondeterminism in programs
inferred← citeshttps://doi.org/10.1145/2499370.2491969openalex-snapshot
Reasoning about nondeterminism in programs
inferred← citeshttps://doi.org/10.1145/3012282openalex-snapshot
Multi-valued Simulation and Abstraction Using Lattice Operations
inferred← citeshttps://doi.org/10.1145/3158100openalex-snapshot
Relatively complete refinement type system for verification of higher-order non-deterministic programs
inferred← citeshttps://doi.org/10.1145/3453483.3454076openalex-snapshot
Polynomial reachability witnesses via Stellensätze
inferred← citeshttps://doi.org/10.12775/llp.2006.015openalex-snapshot
Extended full computation-tree logics for paraconsistent model checking
inferred← citeshttps://doi.org/10.24963/ijcai.2023/834openalex-snapshot
Practical Model Reductions for Verification of Multi-Agent Systems
inferred← citeshttps://doi.org/10.24963/kr.2023/38openalex-snapshot
Practical Abstraction for Model Checking of Multi-Agent Systems
inferred← citeshttps://doi.org/10.3233/978-1-61499-385-8-1openalex-snapshot
May/Must Abstraction-Based Software Model Checking for Sound Verification and Falsification
inferred← citeshttps://doi.org/10.3929/ethz-a-006042704openalex-snapshot
Static Analysis for SystemC with Scoot: From Verification to Simulation
inferred← citeshttps://doi.org/10.4204/eptcs.219.1openalex-snapshot
Efficient CTL Verification via Horn Constraints Solving
inferred← citeshttps://doi.org/10.48456/tr-788openalex-snapshot
Branching-time reasoning for programs (extended version)
inferred← citeshttps://doi.org/10.48550/arxiv.2007.14259openalex-snapshot
Inductive Reachability Witnesses
inferred← citeshttps://doi.org/10.5555/2682923.2682941openalex-snapshot
Disproving termination with overapproximation
inferred← citeshttps://doi.org/10.5555/2682923.2682942openalex-snapshot
Faster Temporal Reasoning for Infinite-State Programs
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.