On the public citation graph
Decidable verification of uninterpreted programs
0 signed · 59 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_20openalex-snapshot
Efficient Algorithms for Model Checking Pushdown Systems
inferredcites →https://doi.org/10.1007/11547662_17openalex-snapshot
A Generic Framework for Interprocedural Analysis of Numerical Properties
inferredcites →https://doi.org/10.1007/11693024_19openalex-snapshot
Assertion Checking over Combined Abstraction of Linear Arithmetic and Uninterpreted Functions
inferredcites →https://doi.org/10.1007/3-540-49019-1_2openalex-snapshot
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
inferredcites →https://doi.org/10.1007/3-540-53982-4_10openalex-snapshot
Static analysis of linear congruence equalities among variables of a program
inferredcites →https://doi.org/10.1007/3-540-58179-0_44openalex-snapshot
Automatic verification of pipelined microprocessor control
inferredcites →https://doi.org/10.1007/978-3-031-30829-1openalex-snapshot
Foundations of Software Science and Computation Structures
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_85openalex-snapshot
A Note on Karr’s Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_17openalex-snapshot
A Polynomial-Time Algorithm for Global Value Numbering
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_6openalex-snapshot
Checking Herbrand Equalities and Beyond
inferredcites →https://doi.org/10.1007/978-3-540-74113-8openalex-snapshot
The Calculus of Computation: Decision Procedures with Applications to Verification
inferredcites →https://doi.org/10.1007/978-3-642-03237-0_22openalex-snapshot
Invariant Checking for Programs with Procedure Calls
inferredcites →https://doi.org/10.1007/978-3-642-03237-0_7openalex-snapshot
Refinement of Trace Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_16openalex-snapshot
Analysis of Boolean Programs
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_2openalex-snapshot
Software Model Checking for People Who Love Automata
inferredcites →https://doi.org/10.1007/bf00268497openalex-snapshot
Affine relationships among variables of a program
inferredcites →https://doi.org/10.1007/s10009-015-0366-1openalex-snapshot
Automatic equivalence checking of programs with uninterpreted functions and integer arithmetic
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/0168-0072(91)90054-popenalex-snapshot
The structure of the models of decidable monadic theories of graphs
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1145/1075382.1075387openalex-snapshot
Analysis of recursive state machines
inferredcites →https://doi.org/10.1145/1516512.1516518openalex-snapshot
Adding nesting structure to words
inferredcites →https://doi.org/10.1145/1925844.1926407openalex-snapshot
Precise reasoning for programs using containers
inferredcites →https://doi.org/10.1145/1925844.1926419openalex-snapshot
The tree width of auxiliary storage
inferredcites →https://doi.org/10.1145/1926385.1926407openalex-snapshot
Precise reasoning for programs using containers
inferredcites →https://doi.org/10.1145/1926385.1926419openalex-snapshot
The tree width of auxiliary storage
inferredcites →https://doi.org/10.1145/2491956.2462169openalex-snapshot
Natural proofs for structure, data, and separation
inferredcites →https://doi.org/10.1145/2594291.2594325openalex-snapshot
Natural proofs for data structure manipulation in C using separation logic
inferredcites →https://doi.org/10.1145/2676726.2676979openalex-snapshot
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth
inferredcites →https://doi.org/10.1145/2676726.2677012openalex-snapshot
Proof Spaces for Unbounded Parallelism
inferredcites →https://doi.org/10.1145/2837614.2837624openalex-snapshot
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
inferredcites →https://doi.org/10.1145/3158098openalex-snapshot
Foundations for natural proofs and quantifier instantiation
inferredcites →https://doi.org/10.1145/3290359openalex-snapshot
Decidable verification of uninterpreted programs
inferredcites →https://doi.org/10.1145/371282.371364openalex-snapshot
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
inferredcites →https://doi.org/10.1145/73560.73561openalex-snapshot
Detecting equality of variables in programs
inferredcites →https://doi.org/10.1145/800070.802201openalex-snapshot
Decidability of reachability in vector addition systems (Preliminary Version)
inferredcites →https://doi.org/10.1145/800076.802477openalex-snapshot
An algorithm for the general Petri net reachability problem
inferredcites →https://doi.org/10.1145/964001.964030openalex-snapshot
Global value numbering using random interpretation
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-45237-7_10openalex-snapshot
What’s Decidable About Program Verification Modulo Axioms?
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_32openalex-snapshot
Decidable Synthesis of Programs with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_29openalex-snapshot
Trace Abstraction-Based Verification for Uninterpreted Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-99253-8_17openalex-snapshot
Temporal Stream Logic modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-031-10363-6_10openalex-snapshot
Collaborative Verification of Uninterpreted Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_1openalex-snapshot
Verifying Tree-Manipulating Programs via CHCs
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_2openalex-snapshot
Automated Verification of Monotonic Data Structure Traversals in C
inferred← citeshttps://doi.org/10.1016/j.scico.2023.103075openalex-snapshot
Verification of message-passing uninterpreted programs
inferred← citeshttps://doi.org/10.1145/3371103openalex-snapshot
Deciding memory safety for single-pass heap-manipulating programs
inferred← citeshttps://doi.org/10.1145/3498671openalex-snapshot
Learning formulas in finite variable logics
inferred← citeshttps://doi.org/10.1145/3632875openalex-snapshot
An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
inferred← citeshttps://doi.org/10.1145/3704870openalex-snapshot
The Decision Problem for Regular First Order Theories
inferred← citeshttps://doi.org/10.1145/3839461openalex-snapshot
EUFⁿ: A Decidable Extension to the Theory of Equality with Uninterpreted Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2111.03534openalex-snapshot
Learning Formulas in Finite Variable Logics
showing the first 16 of 17 · page through all 17
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.