On the public citation graph

Formal Verification of Software Designs in Hierarchical State Transition Matrix with SMT-based Bounded Model Checking

0 signed · 28 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/11691617_9openalex-snapshot
Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers
inferredcites →https://doi.org/10.1007/3-540-45657-0_29openalex-snapshot
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
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-30494-4_14openalex-snapshot
Simple Bounded LTL Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-68855-6_4openalex-snapshot
An SMT Approach to Bounded Reachability Analysis of Model Programs
inferredcites →https://doi.org/10.1007/978-3-540-68863-1_7openalex-snapshot
Symbolic Step Encodings for Object Based Communicating State Machines
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_34openalex-snapshot
CVC3
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-11319-2_13openalex-snapshot
Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing
inferredcites →https://doi.org/10.1007/s10009-008-0091-0openalex-snapshot
Bounded model checking of software using SMT solvers instead of SAT solvers
inferredcites →https://doi.org/10.1109/acsd.2008.4574602openalex-snapshot
Symbolic model checking of hierarchical UML state machines
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1587/transinf.e94.d.946openalex-snapshot
An SMT-Based Approach to Bounded Model Checking of Designs in State Transition Matrix
inferredcites →https://doi.org/10.3233/faia336openalex-snapshot
Handbook of Satisfiability
inferredcites →https://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories

What points at this work

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

inferred← citeshttps://doi.org/10.1002/dac.5140openalex-snapshot
Modeling and reliability verification of industrial control network protocol based on time state transition matrix
inferred← citeshttps://doi.org/10.1016/j.jisa.2016.08.001openalex-snapshot
Garakabu2: an SMT-based bounded model checker for HSTM designs in ZIPC
inferred← citeshttps://doi.org/10.1109/access.2017.2694880openalex-snapshot
Automated Software Testing Based on Hierarchical State Transition Matrix for Smart TV
inferred← citeshttps://doi.org/10.1109/apsec.2012.38openalex-snapshot
On Accelerating SMT-based Bounded Model Checking of HSTM Designs
inferred← citeshttps://doi.org/10.1109/apsec.2013.55openalex-snapshot
Harnessing SMT-Based Bounded Model Checking through Stateless Explicit-State Exploration
inferred← citeshttps://doi.org/10.1109/cit.2012.91openalex-snapshot
Formal Verification of Communicating HSTM Designs
inferred← citeshttps://doi.org/10.1109/dsa.2019.00013openalex-snapshot
Interpolation-Based Multi-core Bounded Model Checking of HSTM Designs
inferred← citeshttps://doi.org/10.1109/fcst.2015.47openalex-snapshot
Energy Consumption Analysis Method of CPS Software Based on Architecture Modeling
inferred← citeshttps://doi.org/10.1109/ica.2016.052openalex-snapshot
ZipPath: A Simple-But-Useful Path Finder for HSTM Designs in ZIPC
inferred← citeshttps://doi.org/10.1109/ica.2016.19openalex-snapshot
ZipPath: A Simple-But-Useful Path Finder for HSTM Designs in ZIPC
inferred← citeshttps://doi.org/10.1109/icpics47731.2019.8942447openalex-snapshot
A New SMT Algorithm Based on Lazy Framework Combining Clause Weight and Reward Mechanism
inferred← citeshttps://doi.org/10.1145/3789418.3789454openalex-snapshot
Verification of Controller Input Feasibility via AI Reasoning with SAT/SMT Solvers
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.