On the public citation graph

Quantified Heap Invariants for Object-Oriented Programs

0 signed · 47 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/11526841_4openalex-snapshot
Modular Verification of Static Class Invariants
inferredcites →https://doi.org/10.1007/11609773_28openalex-snapshot
What’s Decidable About Arrays?
inferredcites →https://doi.org/10.1007/3-540-45332-6_7openalex-snapshot
Alias Types for Recursive Data Structures
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_2openalex-snapshot
SMT-Based Model Checking for Recursive Programs
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_19openalex-snapshot
JayHorn: A Framework for Verifying Java programs
inferredcites →https://doi.org/10.1007/978-3-540-69738-1_18openalex-snapshot
Automated Verification of Shape and Size Properties Via Separation Logic
inferredcites →https://doi.org/10.1007/978-3-642-15769-1_6openalex-snapshot
Statically Inferring Complex Heap, Array, and Numeric Invariants
inferredcites →https://doi.org/10.1007/978-3-642-20398-5_33openalex-snapshot
Infer: An Automatic Program Verifier for Memory Safety of C Programs
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_16openalex-snapshot
CPAchecker: A Tool for Configurable Software Verification
inferredcites →https://doi.org/10.1007/978-3-642-35873-9_12openalex-snapshot
SMT-Based Array Invariant Generation
inferredcites →https://doi.org/10.1007/978-3-642-38856-9_8openalex-snapshot
On Solving Universally Quantified Horn Clauses
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_24openalex-snapshot
Disjunctive Interpolants for Horn-Clause Verification
inferredcites →https://doi.org/10.1007/978-3-662-49122-5_2openalex-snapshot
Viper: A Verification Infrastructure for Permission-Based Reasoning
inferredcites →https://doi.org/10.1007/978-3-662-53413-7_18openalex-snapshot
Cell Morphing: From Array Programs to Array-Free Horn Clauses
inferredcites →https://doi.org/10.1016/0167-6423(89)90034-8openalex-snapshot
Object-oriented software construction
inferredcites →https://doi.org/10.1109/csf.2008.27openalex-snapshot
Refinement Types for Secure Implementations
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1145/1328438.1328468openalex-snapshot
Lifting abstract interpreters to quantified logical domains
inferredcites →https://doi.org/10.1145/1328897.1328468openalex-snapshot
Lifting abstract interpreters to quantified logical domains
inferredcites →https://doi.org/10.1145/1594834.1480917openalex-snapshot
Compositional shape analysis by means of bi-abduction
inferredcites →https://doi.org/10.1145/1890028.1890031openalex-snapshot
Refinement types for secure implementations
inferredcites →https://doi.org/10.1145/1988042.1988050openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/2049697.2049700openalex-snapshot
Compositional Shape Analysis by Means of Bi-Abduction
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
inferredcites →https://doi.org/10.1145/2790449.2790451openalex-snapshot
Verification by abstract interpretation, soundness and abstract induction
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/373243.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.29007/1l7fopenalex-snapshot
Program Verification as 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.1007/978-3-030-34175-6_2openalex-snapshot
On Strings in Software Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_25openalex-snapshot
ConSORT: Context- and Flow-Sensitive Ownership Refinement Types for Imperative Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_9openalex-snapshot
Reasoning in the Theory of Heap: Satisfiability and Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-030-72013-1_29openalex-snapshot
Towards String Support in JayHorn (Competition Contribution)
inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_16openalex-snapshot
Solving Constrained Horn Clauses over Algebraic Data Types
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_9openalex-snapshot
Weakest Precondition Inference for Non-Deterministic Linear Array Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-82700-6_10openalex-snapshot
Automatic Inference of Relational Object Invariants
inferred← citeshttps://doi.org/10.1007/978-3-031-87054-5_4openalex-snapshot
Finding Universally Quantified Heap Invariants by Horn Clause Transformations
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_3openalex-snapshot
Arithmetizing Shape Analysis
inferred← citeshttps://doi.org/10.1007/s10703-026-00493-wopenalex-snapshot
A program instrumentation framework for automatic verification
inferred← citeshttps://doi.org/10.1145/3340672.3341113openalex-snapshot
JayHorn
inferred← citeshttps://doi.org/10.1145/3462205openalex-snapshot
RustHorn: CHC-based Verification for Rust Programs
inferred← citeshttps://doi.org/10.15514/ispras-2019-31(5)-3openalex-snapshot
Automatic verification of heap-manipulating programs
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cedopenalex-snapshot
Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays
inferred← citeshttps://doi.org/10.4204/eptcs.320.12openalex-snapshot
Proceedings 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:26)2022openalex-snapshot
Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays
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.