On the public citation graph
Tuning SAT Checkers for Bounded Model Checking
0 signed · 164 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/10722167_36openalex-snapshot
Tuning SAT Checkers for Bounded Model Checking
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-48683-6_8openalex-snapshot
Verifying Safety Properties of a PowerPC− Microprocessor Using Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/3-540-63104-6_28openalex-snapshot
SATO: An efficient propositional prover
inferredcites →https://doi.org/10.1007/3-540-63166-6_53openalex-snapshot
RuleBase: Model checking at IBM
inferredcites →https://doi.org/10.1007/bfb0028744openalex-snapshot
On-the-fly model checking of RCTL formulas
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/dac.1996.545656openalex-snapshot
RuleBase: an industry-oriented formal verification tool
inferredcites →https://doi.org/10.1109/iccad.1996.569084openalex-snapshot
CTL model checking based on forward state traversal
inferredcites →https://doi.org/10.1145/271771.271798openalex-snapshot
Improving efficiency of symbolic model checking for state-based system requirements
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.21236/ada360973openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.5555/244522.244536openalex-snapshot
CTL model checking based on forward state traversal
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-34600-7openalex-snapshot
Abstraction Refinement for Large Scale Model Checking
inferred← citeshttps://doi.org/10.1007/11527695_10openalex-snapshot
Automatic Extraction of Functional Dependencies
inferred← citeshttps://doi.org/10.1007/11527695_4openalex-snapshot
Incremental Compilation-to-SAT Procedures
inferred← citeshttps://doi.org/10.1007/11562948_14openalex-snapshot
Selective Search in Bounded Model Checking of Reachability Properties
inferred← citeshttps://doi.org/10.1007/11750321_58openalex-snapshot
Improved SAT Based Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/11757283_5openalex-snapshot
SAT-Based Verification Methods and Applications in Hardware Verification
inferred← citeshttps://doi.org/10.1007/11757283_6openalex-snapshot
Building Efficient Decision Procedures on Top of SAT Solvers
inferred← citeshttps://doi.org/10.1007/11757375_22openalex-snapshot
An Efficient Hybrid Strategy for Temporal Planning
inferred← citeshttps://doi.org/10.1007/3-540-36126-x_12openalex-snapshot
Qubos: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/3-540-36135-9_16openalex-snapshot
Bounded Model Checking for Timed Systems
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_3openalex-snapshot
Bounded Model Checking for Past LTL
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_4openalex-snapshot
Experimental Analysis of Different Techniques for Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_43openalex-snapshot
Benefits of Bounded Model Checking at an Industrial Setting
inferred← citeshttps://doi.org/10.1007/3-540-44798-9_4openalex-snapshot
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_17openalex-snapshot
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions
inferred← citeshttps://doi.org/10.1007/3-540-45627-9_10openalex-snapshot
Formal Verification Methods for Industrial Hardware Design
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_21openalex-snapshot
Semi-formal Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_29openalex-snapshot
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_25openalex-snapshot
Dependent and Independent Variables in Propositional Satisfiability
inferred← citeshttps://doi.org/10.1007/3-540-45988-x_5openalex-snapshot
Integrating BDD-Based and SAT-Based Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_13openalex-snapshot
Recovering and Exploiting Structural Knowledge from CNF Formulas
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_14openalex-snapshot
Improving the Encoding of LTL Model Checking into SAT
inferred← citeshttps://doi.org/10.1007/978-1-4471-2795-6_3openalex-snapshot
Hybrid Systems: Deterministic to Stochastic Perspectives
inferred← citeshttps://doi.org/10.1007/978-1-4614-1359-2_6openalex-snapshot
Decision Ordering Based Learning Techniques
inferred← citeshttps://doi.org/10.1007/978-1-4614-1359-2_9openalex-snapshot
Learning-Oriented Property Decomposition Approaches
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_20openalex-snapshot
Partial Order Reduction for Deep Bug Finding in Synchronous Hardware
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_5openalex-snapshot
Four Flavors of Entailment
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_6openalex-snapshot
Designing New Phase Selection Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_53openalex-snapshot
Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models
inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_12openalex-snapshot
CosySEL: Improving SAT Solving Using Local Symmetries
inferred← citeshttps://doi.org/10.1007/978-3-319-18008-3_28openalex-snapshot
Learning General Constraints in CSP
inferred← citeshttps://doi.org/10.1007/978-3-319-68972-2_16openalex-snapshot
Model Checking of Concurrent Software Systems via Heuristic-Guided SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_4openalex-snapshot
Solving MaxSAT with Bit-Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_7openalex-snapshot
Chronological Backtracking
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_8openalex-snapshot
Program Analysis Is Harder Than Verification: A Computability Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_19openalex-snapshot
Using Problem Structure for Efficient Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_22openalex-snapshot
Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_30openalex-snapshot
SBSAT: a State-Based, BDD-Based Satisfiability Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_13openalex-snapshot
Simple Yet Efficient Improvements of SAT Based Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_20openalex-snapshot
Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_46openalex-snapshot
Decision Procedures for the Grand Challenge
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_26openalex-snapshot
Limitations of Restricted Branching in Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-01748-3_15openalex-snapshot
Hybrid BDD and All-SAT Method for Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-18222-8_4openalex-snapshot
SAT-Based (Parametric) Reachability for a Class of Distributed Time Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_23openalex-snapshot
Generating Diverse Solutions in SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-24690-6_13openalex-snapshot
Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods
inferred← citeshttps://doi.org/10.1007/s001650300005openalex-snapshot
Verifying the IEEE 1394 FireWire Tree Identify Protocol with SMV
inferred← citeshttps://doi.org/10.1007/s10009-004-0183-4openalex-snapshot
A survey of recent advances in SAT-based formal verification
inferred← citeshttps://doi.org/10.1007/s10009-019-00547-xopenalex-snapshot
IC3 software model checking
inferred← citeshttps://doi.org/10.1007/s10270-012-0295-3openalex-snapshot
Improving the SAT modulo ODE approach to hybrid systems analysis by combining different enclosure methods
inferred← citeshttps://doi.org/10.1007/s10472-005-7034-1openalex-snapshot
Unrestricted vs restricted cut in a tableau method for Boolean circuits
inferred← citeshttps://doi.org/10.1007/s10601-008-9062-zopenalex-snapshot
Limitations of restricted branching in clause learning
inferred← citeshttps://doi.org/10.1007/s10601-022-09339-8openalex-snapshot
Towards better heuristics for solving bounded model checking problems
inferred← citeshttps://doi.org/10.1007/s10664-025-10729-8openalex-snapshot
Application of AI to formal methods — an analysis of current trends
inferred← citeshttps://doi.org/10.1007/s10703-006-0020-3openalex-snapshot
Verification of SpecC using predicate abstraction
inferred← citeshttps://doi.org/10.1007/s10703-006-0031-0openalex-snapshot
HySAT: An efficient proof engine for bounded model checking of hybrid systems
inferred← citeshttps://doi.org/10.1007/s10703-011-0121-5openalex-snapshot
Feasibility analysis for robustness quantification by symbolic model checking
inferred← citeshttps://doi.org/10.1007/s10836-014-5452-xopenalex-snapshot
Learning-oriented Property Decomposition for Automated Generation of Directed Tests
inferred← citeshttps://doi.org/10.1007/s11704-016-6048-7openalex-snapshot
Efficient software product-line model checking using induction and a SAT solver
inferred← citeshttps://doi.org/10.1016/b978-0-12-370616-4.x5001-0openalex-snapshot
Verification Techniques for System-Level Design
inferred← citeshttps://doi.org/10.1016/b978-012370616-4.50005-7openalex-snapshot
Verification Algorithms for FSM Models
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.001openalex-snapshot
Backdoors to tractable answer set programming
inferred← citeshttps://doi.org/10.1016/j.artint.2016.06.002openalex-snapshot
Learning general constraints in CSP
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.021openalex-snapshot
On enumerating short projected models
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.061openalex-snapshot
Efficient Proof Engines for Bounded Model Checking of Hybrid Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.12.022openalex-snapshot
Verifying Industrial Hybrid Systems with MathSAT
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.07.021openalex-snapshot
Computing Over-Approximations with Bounded Model Checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.12.021openalex-snapshot
Interpolant Learning and Reuse in SAT-Based Model Checking
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.005openalex-snapshot
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.007openalex-snapshot
Model checking with Boolean Satisfiability
inferred← citeshttps://doi.org/10.1016/j.scico.2011.07.008openalex-snapshot
SAT-solving in CSP trace refinement
inferred← citeshttps://doi.org/10.1016/j.scico.2015.10.016openalex-snapshot
Modeling and verification of component connectors in Coq
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00375-2openalex-snapshot
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00331-7openalex-snapshot
Formal Verification based on Boolean Expression Diagrams
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82542-3openalex-snapshot
Temporal Induction by Incremental SAT Solving
inferred← citeshttps://doi.org/10.1023/a:1011276507260openalex-snapshot
Bounded Model Checking Using Satisfiability Solving
inferred← citeshttps://doi.org/10.1023/b:form.0000004785.67232.f8openalex-snapshot
Accelerating Bounded Model Checking of Safety Properties
inferred← citeshttps://doi.org/10.1109/apsec57359.2022.00038openalex-snapshot
Tuning SAT solvers for LTL Model Checking
inferred← citeshttps://doi.org/10.1109/aspdac.2007.358110openalex-snapshot
Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets
inferred← citeshttps://doi.org/10.1109/date.2004.1268842openalex-snapshot
Using counter example guided abstraction refinement to find complex bugs
inferred← citeshttps://doi.org/10.1109/date.2004.1268923openalex-snapshot
Functional coverage metric generation from temporal event relation graph
inferred← citeshttps://doi.org/10.1109/date.2010.5457156openalex-snapshot
Efficient decision ordering techniques for SAT-based test generation
inferred← citeshttps://doi.org/10.1109/date.2011.5763037openalex-snapshot
Decision ordering based property decomposition for functional test generation
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/famcad.2007.9openalex-snapshot
Boosting Verification by Automatic Tuning of Decision Procedures
inferred← citeshttps://doi.org/10.1109/fmcad.2007.13openalex-snapshot
Boosting Verification by Automatic Tuning of Decision Procedures
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.17openalex-snapshot
A Theory-Based Decision Heuristic for DPLL(T)
inferred← citeshttps://doi.org/10.1109/host68814.2026.11604624openalex-snapshot
BlindMarket: Enabling Verifiable, Confidential, and Traceable IP Core Distribution in Zero-Trust Settings
inferred← citeshttps://doi.org/10.1109/iccd.2003.1240872openalex-snapshot
Specifying and verifying systems with multiple clocks
inferred← citeshttps://doi.org/10.1109/iccd.2013.6657070openalex-snapshot
Selecting critical implications with set-covering formulation for SAT-based Bounded Model Checking
inferred← citeshttps://doi.org/10.1109/iceccs.2013.21openalex-snapshot
Reusing Search Tree for Incremental SAT Solving of Temporal Induction
inferred← citeshttps://doi.org/10.1109/iceccs.2014.23openalex-snapshot
Clause Replication and Reuse in Incremental Temporal Induction
inferred← citeshttps://doi.org/10.1109/ictai.2017.00136openalex-snapshot
On Selecting Constraints for Replication in Model Checking
inferred← citeshttps://doi.org/10.1109/icvd.2004.1260982openalex-snapshot
Can SAT be used to improve sequential ATPG methods?
inferred← citeshttps://doi.org/10.1109/ladc.2013.20openalex-snapshot
Accelerating Online Model Checking
inferred← citeshttps://doi.org/10.1109/les.2024.3439859openalex-snapshot
Methodology for Formal Verification of Hardware Safety Strategies Using SMT
inferred← citeshttps://doi.org/10.1109/mtv.2003.1250266openalex-snapshot
Tuning the VSIDS decision heuristic for bounded model checking
inferred← citeshttps://doi.org/10.1109/rme.2008.4595747openalex-snapshot
On the validation of embedded systems through functional ATPG
inferred← citeshttps://doi.org/10.1109/tai.2003.1250176openalex-snapshot
Eliminating redundancies in SAT search trees
inferred← citeshttps://doi.org/10.1109/tase.2013.11openalex-snapshot
Optimizing the SAT Decision Ordering of Bounded Model Checking by Structural Information
inferred← citeshttps://doi.org/10.1109/tc.2011.49openalex-snapshot
Property Learning Techniques for Efficient Generation of Directed Tests
inferred← citeshttps://doi.org/10.1109/tcad.2003.819900openalex-snapshot
Optimization-Intensive Watermarking Techniques for Decision Problems
inferred← citeshttps://doi.org/10.1109/tsmcb.2002.805807openalex-snapshot
A Simplifier for Propositional Formulas With Many Binary Clauses
inferred← citeshttps://doi.org/10.1109/wstfes.2004.1300419openalex-snapshot
Methodology for analysis and design of systems
inferred← citeshttps://doi.org/10.1145/1007512.1007536openalex-snapshot
Modeling and verification of an air traffic concept of operations
inferred← citeshttps://doi.org/10.1145/1177352.1177354openalex-snapshot
Propositional Satisfiability and Constraint Programming
inferred← citeshttps://doi.org/10.1145/2380445.2380480openalex-snapshot
Efficient self-learning techniques for SAT-based test generation
inferred← citeshttps://doi.org/10.1145/3091528openalex-snapshot
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances
inferred← citeshttps://doi.org/10.1145/3238147.3238218openalex-snapshot
Control flow-guided SMT solving for program verification
inferred← citeshttps://doi.org/10.1145/3332466.3374529openalex-snapshot
Parallel and distributed bounded model checking of multi-threaded programs
inferred← citeshttps://doi.org/10.1145/3395363.3397378openalex-snapshot
Fast bit-vector satisfiability
inferred← citeshttps://doi.org/10.1145/3446211openalex-snapshot
Leveraging Control Flow Knowledge in SMT Solving of Program Verification
inferred← citeshttps://doi.org/10.1145/3610579openalex-snapshot
Proceedings of the 21st ACM-IEEE International Conference on Formal Methods and Models for System Design
inferred← citeshttps://doi.org/10.1145/3610579.3611083openalex-snapshot
Harnessing Multiple BMC Engines together for Efficient Formal Verification
inferred← citeshttps://doi.org/10.1145/3675168openalex-snapshot
MAB-BMC: A Formal Verification Enhancer by Harnessing Multiple BMC Engines Together
inferred← citeshttps://doi.org/10.1145/378239.379018openalex-snapshot
Dynamic detection and removal of inactive clauses in SAT with application in image computation
inferred← citeshttps://doi.org/10.1145/775832.775928openalex-snapshot
Behavioral consistency of C and verilog programs using bounded model checking
inferred← citeshttps://doi.org/10.1145/775925.775928openalex-snapshot
Behavioral consistency of C and verilog programs using bounded model checking
inferred← citeshttps://doi.org/10.1145/996566.996711openalex-snapshot
A SAT-based algorithm for reparameterization in symbolic simulation
inferred← citeshttps://doi.org/10.1145/996566.996713openalex-snapshot
Refining the SAT decision ordering for bounded model checking
inferred← citeshttps://doi.org/10.14236/ewic/vecos2010.9openalex-snapshot
SBMC : Symmetric Bounded Model Checking
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.23.307openalex-snapshot
Faster FDR Counterexample Generation Using SAT-Solving
inferred← citeshttps://doi.org/10.14288/1.0051356openalex-snapshot
Exploiting structure for scalable software verification
inferred← citeshttps://doi.org/10.14288/1.0051649openalex-snapshot
Formal equivalence checking of software specifications vs. hardware implementations
inferred← citeshttps://doi.org/10.15760/etd.1041openalex-snapshot
Developing a Strategic Policy Choice Framework for Technological Innovation: Case of Chinese Pharmaceuticals
inferred← citeshttps://doi.org/10.15760/etd.1066openalex-snapshot
Equivalence Checking for High-Assurance Behavioral Synthesis
inferred← citeshttps://doi.org/10.1613/jair.1410openalex-snapshot
Towards Understanding and Harnessing the Potential of Clause Learning
inferred← citeshttps://doi.org/10.21236/ada461052openalex-snapshot
Behavioral Consistency of C and Verilog Programs Using Bounded Model Checking
inferred← citeshttps://doi.org/10.3233/aic-2009-0445openalex-snapshot
Structure-based satisfiability checking
inferred← citeshttps://doi.org/10.3233/fi-2010-272openalex-snapshot
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
inferred← citeshttps://doi.org/10.3233/fi-2011-513openalex-snapshot
BDD-based Bounded Model Checking for Temporal Properties of 1-Safe Petri Nets
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.3929/ethz-a-006787534openalex-snapshot
Linear Arithmetic with Bit-Vectors using Omega and SAT
inferred← citeshttps://doi.org/10.48550/arxiv.2103.10267openalex-snapshot
Exploiting Isomorphic Subgraphs in SAT (Long version)
inferred← citeshttps://doi.org/10.5287/ora-kk4jvdod9openalex-snapshot
Techniques and tools for the verification of concurrent systems
inferred← citeshttps://doi.org/10.5555/1870926.1871043openalex-snapshot
Efficient decision ordering techniques for SAT-based test generation
inferred← citeshttps://doi.org/10.5555/1998496.1998538openalex-snapshot
Propelling SAT and SAT-based BMC using careset
inferred← citeshttps://doi.org/10.5555/968878.968980openalex-snapshot
Functional coverage metric generation from temporal event relation graph
inferred← citeshttps://doi.org/10.5555/968878.969048openalex-snapshot
Using counter example guided abstraction refinement to find complex bugs
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95294openalex-snapshot
Bounded model checking for asynchronous concurrent systems
inferred← citeshttps://doi.org/10.70675/38dcf47bz60b4z4a7dzb09fz43d98be9b60fopenalex-snapshot
Effective Encoding of Critical Systems for SAT-Based Model Checking.
inferred← citeshttps://doi.org/10.70675/3c8f1c5bzc67ez4d47z82bcz11d3e11292d6openalex-snapshot
Contribution to SAT-based Bounded Model Checking
inferred← citeshttps://doi.org/10.70675/a52c999az4bc6z429eza297z0a41883df006openalex-snapshot
Etude des Mécanismes de Transformation de Modèles CSP/SAT
showing the first 148 of 149 · page through all 149
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.