On the public citation graph
Abstraction Refinement for Bounded Model Checking
0 signed · 44 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/3-540-36126-x_3openalex-snapshot
Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis
inferredcites →https://doi.org/10.1007/3-540-36577-x_13openalex-snapshot
Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation
inferredcites →https://doi.org/10.1007/3-540-36577-x_2openalex-snapshot
Automatic Abstraction without Counterexamples
inferredcites →https://doi.org/10.1007/3-540-45657-0_20openalex-snapshot
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
inferredcites →https://doi.org/10.1007/3-540-45657-0_6openalex-snapshot
Symbolic Localization Reduction with Reconstruction Layering and Backtracking
inferredcites →https://doi.org/10.1007/3-540-48159-1_5openalex-snapshot
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-30494-4_19openalex-snapshot
A Hybrid of Counterexample-Based and Proof-Based Abstraction
inferredcites →https://doi.org/10.1016/0898-1221(95)90267-8openalex-snapshot
Computer-aided verification of coordinating processes: The automata-theoretic approach
inferredcites →https://doi.org/10.1109/iccad.2003.1257811openalex-snapshot
Iterative abstraction using SAT-based BMC with proof analysis
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/996566.996713openalex-snapshot
Refining the SAT decision ordering for bounded model checking
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes
inferredcites →https://doi.org/10.5555/996070.1009924openalex-snapshot
Iterative Abstraction using SAT-based BMC with Proof Analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11691372_15openalex-snapshot
Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking
inferred← citeshttps://doi.org/10.1007/11901914_6openalex-snapshot
A Probabilistic Learning Approach for Counterexample Guided Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_13openalex-snapshot
Abstraction and Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_31openalex-snapshot
Combining Abstraction Refinement and SAT-Based Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-71493-4_32openalex-snapshot
CEGAR Based Bounded Model Checking of Discrete Time Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-75698-9_23openalex-snapshot
Implication-Based Approximating Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_7openalex-snapshot
Abstract Model Checking without Computing the Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-662-49122-5_16openalex-snapshot
Abstraction-driven Concolic Testing
inferred← citeshttps://doi.org/10.1007/s10009-011-0185-yopenalex-snapshot
An abstraction refinement approach combining precise and approximated techniques
inferred← citeshttps://doi.org/10.1007/s10703-016-0257-4openalex-snapshot
Infinite-state invariant checking with IC3 and predicate abstraction
inferred← citeshttps://doi.org/10.1007/s10703-022-00406-7openalex-snapshot
Interpolation with guided refinement: revisiting incrementality in SAT-based unbounded model checking
inferred← citeshttps://doi.org/10.1007/s10703-023-00434-xopenalex-snapshot
Verification modulo theories
inferred← citeshttps://doi.org/10.1016/j.scico.2019.02.002openalex-snapshot
Three-valued bounded model checking with cause-guided abstraction refinement
inferred← citeshttps://doi.org/10.1093/comjnl/bxm085openalex-snapshot
Heuristic-Guided Abstraction Refinement
inferred← citeshttps://doi.org/10.1109/aspdac.2007.358003openalex-snapshot
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
inferred← citeshttps://doi.org/10.1109/ecbs.2007.40openalex-snapshot
Exploring Clause Symmetry in a Distributed Bounded Model Checking Algorithm
inferred← citeshttps://doi.org/10.1109/ecbs.2009.26openalex-snapshot
Distributed BMC: A Depth-First Approach to Explore Clause Symmetry
inferred← citeshttps://doi.org/10.1109/rsp.2009.21openalex-snapshot
WoLFram- A Word Level Framework for Formal Verification
inferred← citeshttps://doi.org/10.1109/tc.2009.105openalex-snapshot
Integrating Evolutionary Computation with Abstraction Refinement for Model Checking
inferred← citeshttps://doi.org/10.1145/1228784.1228878openalex-snapshot
Effective heuristics for counterexample-guided abstraction refinement
inferred← citeshttps://doi.org/10.1145/1529282.1529404openalex-snapshot
The synergy of precise and fast abstractions for program verification
inferred← citeshttps://doi.org/10.1609/aaai.v37i12.26772openalex-snapshot
Neural Policy Safety Verification via Predicate Abstraction: CEGAR
inferred← citeshttps://doi.org/10.1613/jair.2817openalex-snapshot
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
inferred← citeshttps://doi.org/10.29007/scv7openalex-snapshot
EPR-based k-induction with Counterexample Guided Abstraction Refinement
inferred← citeshttps://doi.org/10.3233/sat190061openalex-snapshot
HaifaSat: a SAT solver based on an Abstraction/Refinement model
inferred← citeshttps://doi.org/10.5555/1775223.1775246openalex-snapshot
Implication-based approximating bounded model checking
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95294openalex-snapshot
Bounded model checking for asynchronous concurrent 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.