On the public citation graph

Program Verification as Satisfiability Modulo Theories

0 signed · 51 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/11804192_17openalex-snapshot
Boogie: A Modular Reusable Verifier for Object-Oriented Programs
inferredcites →https://doi.org/10.1007/978-3-540-69611-7_16openalex-snapshot
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_36openalex-snapshot
μZ– An Efficient Engine for Fixed Points with Constraints
inferredcites →https://doi.org/10.1007/978-3-642-23702-7_23openalex-snapshot
Satisfiability Modulo Recursive Programs
inferredcites →https://doi.org/10.1007/978-3-642-27940-9_4openalex-snapshot
Whale: An Interpolation-Based Algorithm for Inter-procedural Verification
inferredcites →https://doi.org/10.1007/978-3-642-28717-6_32openalex-snapshot
The TPTP Typed First-Order Form with Arithmetic
inferredcites →https://doi.org/10.1007/978-3-642-28756-5_12openalex-snapshot
From Under-Approximations to Over-Approximations and Back
inferredcites →https://doi.org/10.1007/978-3-642-31612-8_13openalex-snapshot
Generalized Property Directed Reachability
inferredcites →https://doi.org/10.1145/1706299.1706309openalex-snapshot
Program analysis via satisfiability modulo path programs
inferredcites →https://doi.org/10.1145/1707801.1706309openalex-snapshot
Program analysis via satisfiability modulo path programs
inferredcites →https://doi.org/10.1145/1925844.1926424openalex-snapshot
Predicate abstraction and refinement for verifying multi-threaded programs
inferredcites →https://doi.org/10.1145/1926385.1926424openalex-snapshot
Predicate abstraction and refinement for verifying multi-threaded programs
inferredcites →https://doi.org/10.1145/2254064.2254112openalex-snapshot
Synthesizing software verifiers from proof rules
inferredcites →https://doi.org/10.1145/2345156.2254112openalex-snapshot
Synthesizing software verifiers from proof rules

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-59638-5_7openalex-snapshot
On the Verification of Smart Contracts: A Systematic Review
inferred← citeshttps://doi.org/10.1007/978-3-031-75778-5_9openalex-snapshot
The Transformation Game: Joining Forces for Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_8openalex-snapshot
Branching Bisimulation Learning
inferred← citeshttps://doi.org/10.1007/978-3-032-28079-4_10openalex-snapshot
Bit-Vector CHC Solving for Binary Analysis and Binary Analysis for Bit-Vector CHC Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-10431-7_17openalex-snapshot
Rapid Prototyping of a Semantically Well Founded Circus Model Checker
inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_20openalex-snapshot
The SeaHorn Verification Framework
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_2openalex-snapshot
Horn Clause Solvers for Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_21openalex-snapshot
Satisfiability Modulo Heap-Based Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_25openalex-snapshot
Higher-Order Program Verification via HFL Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_8openalex-snapshot
On Solving Universally Quantified Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-642-41036-9_4openalex-snapshot
Reachability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_11openalex-snapshot
Verifying Array Programs by Transforming Verification Conditions
inferred← citeshttps://doi.org/10.1007/978-3-642-54108-7_1openalex-snapshot
Classifying and Solving Horn Clauses for Verification
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_2openalex-snapshot
Verifying and Synthesizing Software with Recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_41openalex-snapshot
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
inferred← citeshttps://doi.org/10.1007/978-981-99-8311-7_12openalex-snapshot
Argument Reduction of Constrained Horn Clauses Using Equality Constraints
inferred← citeshttps://doi.org/10.1007/s10817-017-9419-3openalex-snapshot
Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories
inferred← citeshttps://doi.org/10.1016/j.pmcj.2020.101227openalex-snapshot
Verification of smart contracts: A survey
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.017openalex-snapshot
Program verification via iterated specialization
inferred← citeshttps://doi.org/10.1016/j.scico.2016.11.002openalex-snapshot
Semantics-based generation of verification conditions via program specialization
inferred← citeshttps://doi.org/10.1017/s1471068415000289openalex-snapshot
Proving correctness of imperative programs by linearizing constrained Horn clauses
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00109openalex-snapshot
SMTgazer: Learning to Schedule SMT Algorithms via Bayesian Optimization
inferred← citeshttps://doi.org/10.1109/fmcad.2015.7542257openalex-snapshot
Compositional verification of procedural programs using horn clauses over integers and arrays
inferred← citeshttps://doi.org/10.1109/jiot.2020.3047550openalex-snapshot
Blockchain for Diamond Industry: Opportunities and Challenges
inferred← citeshttps://doi.org/10.1109/jiot.2024.3374556openalex-snapshot
TapChecker: A Lightweight SMT-Based Conflict Analysis for Trigger-Action Programming
inferred← citeshttps://doi.org/10.1145/2535838.2535857openalex-snapshot
Symbolic optimization with SMT solvers
inferred← citeshttps://doi.org/10.1145/2603088.2603091openalex-snapshot
A decision procedure for satisfiability in separation logic with inductive predicates
inferred← citeshttps://doi.org/10.1145/3394514.3394517openalex-snapshot
Verification of Ada Programs with AdaHorn
inferred← citeshttps://doi.org/10.1145/3632843openalex-snapshot
Ramsey Quantifiers in Linear Arithmetics
inferred← citeshttps://doi.org/10.14722/ndss.2018.23082openalex-snapshot
ZEUS: Analyzing Safety of Smart Contracts
inferred← citeshttps://doi.org/10.29007/pz3topenalex-snapshot
Abduction by Non-Experts
inferred← citeshttps://doi.org/10.29007/zrctopenalex-snapshot
Quantified Heap Invariants for Object-Oriented Programs
inferred← citeshttps://doi.org/10.3233/fi-2017-1461openalex-snapshot
Program Verification using Constraint Handling Rules and Array Constraint Generalizations*
inferred← citeshttps://doi.org/10.3390/electronics8101163openalex-snapshot
Deductive Verification Method of Real-Time Safety Properties for Embedded Assembly Programs
inferred← citeshttps://doi.org/10.4204/eptcs.169.3openalex-snapshot
Verification of Programs by Combining Iterated Specialization with Interpolation
inferred← citeshttps://doi.org/10.4204/eptcs.344.4openalex-snapshot
Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses
inferred← citeshttps://doi.org/10.48550/arxiv.1412.1151openalex-snapshot
Verification of Programs by Combining Iterated Specialization with Interpolation
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.