On the public citation graph
Symbolic Execution with Separation Logic
0 signed · 307 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/11417170_22openalex-snapshot
L3: A Linear Language with Locations
inferredcites →https://doi.org/10.1007/11693024_10openalex-snapshot
ILC: A Foundation for Automated Reasoning About Pointer Programs
inferredcites →https://doi.org/10.1007/11804192_6openalex-snapshot
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
inferredcites →https://doi.org/10.1007/3-540-44622-2_19openalex-snapshot
Disjunctive Tautologies as Synchronisation Schemes
inferredcites →https://doi.org/10.1007/3-540-44802-0_1openalex-snapshot
Local Reasoning about Programs that Alter Data Structures
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-540-27815-3_36openalex-snapshot
Extending Separation Logic with Fixpoints and Postponed Substitution
inferredcites →https://doi.org/10.1007/978-3-540-30538-5_2openalex-snapshot
Verifying Probabilistic Procedural Programs
inferredcites →https://doi.org/10.1007/978-3-540-30538-5_9openalex-snapshot
A Decidable Fragment of Separation Logic
inferredcites →https://doi.org/10.1007/978-94-017-0091-7openalex-snapshot
The Semantics and Proof Theory of the Logic of Bunched Implications
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.071openalex-snapshot
Extending separation logic with fixpoints and postponed substitution
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/1040305.1040330openalex-snapshot
A semantics for procedure local heaps and its abstractions
inferredcites →https://doi.org/10.1145/1988042.1988050openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/360204.375719openalex-snapshot
BI as an assertion language for mutable data structures
inferredcites →https://doi.org/10.1145/378795.378851openalex-snapshot
The pointer assertion logic engine
inferredcites →https://doi.org/10.1145/514188.514190openalex-snapshot
Parametric shape analysis via 3-valued logic
inferredcites →https://doi.org/10.1145/570886.570888openalex-snapshot
Data abstraction and information hiding
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11691372_19openalex-snapshot
A Local Shape Analysis Based on Separation Logic
inferred← citeshttps://doi.org/10.1007/11693024_10openalex-snapshot
ILC: A Foundation for Automated Reasoning About Pointer Programs
inferred← citeshttps://doi.org/10.1007/11804192_14openalex-snapshot
Safety and Liveness in Concurrent Pointer Programs
inferred← citeshttps://doi.org/10.1007/11804192_6openalex-snapshot
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
inferred← citeshttps://doi.org/10.1007/11817963_35openalex-snapshot
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
inferred← citeshttps://doi.org/10.1007/11823230_13openalex-snapshot
Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
inferred← citeshttps://doi.org/10.1007/11823230_16openalex-snapshot
Interprocedural Shape Analysis with Separated Heap Abstractions
inferred← citeshttps://doi.org/10.1007/11901433_22openalex-snapshot
Formal Verification of the Heap Manager of an Operating System Using Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-00009-7_26openalex-snapshot
The New Progress in the Research of Binary Vulnerability Exploits
inferred← citeshttps://doi.org/10.1007/978-3-030-02768-1_14openalex-snapshot
Modular Verification of SPARCv8 Code
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_3openalex-snapshot
Semi-automated Reasoning About Non-determinism in C Expressions
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_13openalex-snapshot
SecCSL: Security Concurrent Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-31784-3_12openalex-snapshot
Enhancing Symbolic Execution of Heap-Based Programs with Separation Logic for Test Input Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-34175-6_19openalex-snapshot
Completeness of Cyclic Proofs for Symbolic Heaps with Inductive Definitions
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_19openalex-snapshot
A First-Order Logic with Frames
inferred← citeshttps://doi.org/10.1007/978-3-030-44914-8_6openalex-snapshot
Concise Read-Only Specifications for Better Synthesis of Programs with Pointers
inferred← citeshttps://doi.org/10.1007/978-3-030-59025-3_6openalex-snapshot
Restriction on Cut in Cyclic Proof System for Symbolic Heaps
inferred← citeshttps://doi.org/10.1007/978-3-030-76920-8_5openalex-snapshot
An Algebraic Glimpse at Bunched Implications and Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-77474-5_9openalex-snapshot
Pointer Program Synthesis as Non-deterministic Planning
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_1openalex-snapshot
Non-well-founded Deduction for Induction and Coinduction
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_5openalex-snapshot
Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_17openalex-snapshot
Generalized Arrays for Stainless Frames
inferred← citeshttps://doi.org/10.1007/978-3-030-99336-8_3openalex-snapshot
Foundations for Entailment Checking in Quantitative Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-19849-6_4openalex-snapshot
A Hoare Logic with Regular Behavioral Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_32openalex-snapshot
Make Flows Small Again: Revisiting the Flow Framework
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_23openalex-snapshot
An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-76554-4_13openalex-snapshot
Correct and Complete Symbolic Execution for Free
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-032-04167-8_5openalex-snapshot
Deciding Satisfiability for Overlaid Symbolic Heaps
inferred← citeshttps://doi.org/10.1007/978-3-319-02654-1_16openalex-snapshot
A Generic Framework for Symbolic Execution
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_7openalex-snapshot
Separation Logic Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_2openalex-snapshot
Mostly Sound Type System Improves a Foundational Program Verifier
inferred← citeshttps://doi.org/10.1007/978-3-319-04915-1_3openalex-snapshot
Integrating Separation Logic with PPTL
inferred← citeshttps://doi.org/10.1007/978-3-319-09108-2_5openalex-snapshot
Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-10431-7_3openalex-snapshot
Completeness of Separation Logic with Inductive Definitions for Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_5openalex-snapshot
Cyclic Abduction of Inductively Defined Safety and Termination Preconditions
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_34openalex-snapshot
Automated Theorem Proving for Assertions in Separation Logic with All Connectives
inferred← citeshttps://doi.org/10.1007/978-3-319-22969-0_3openalex-snapshot
Learning Assertions to Verify Linked-List Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-24312-2_20openalex-snapshot
Disproving Inductive Entailments in Separation Logic via Base Pair Approximation
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_7openalex-snapshot
On Automated Lemma Generation for Separation Logic with Inductive Definitions
inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_5openalex-snapshot
Separation Logic with Monadic Inductive Definitions and Implicit Existentials
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_36openalex-snapshot
A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints
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-41528-4_23openalex-snapshot
From Shape Analysis to Termination Analysis in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_22openalex-snapshot
Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_23openalex-snapshot
Completeness for a First-Order Abstract Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_55openalex-snapshot
Using Unified Model Checking to Verify Heaps
inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_40openalex-snapshot
Automated Mutual Explicit Induction Proof in Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-49815-7_9openalex-snapshot
An Evolutionary Approach to Translate Operational Specifications into Declarative Specifications
inferred← citeshttps://doi.org/10.1007/978-3-319-56841-6_6openalex-snapshot
Formal Reasoning on Infinite Data Values: An Ongoing Quest
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_31openalex-snapshot
Satisfiability of Compositional Separation Logic with Tree Predicates and Data Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_26openalex-snapshot
A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_19openalex-snapshot
Proof Tactics for Assertions in Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_9openalex-snapshot
Decision Procedure for Entailment of Symbolic Heaps with Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-89960-2_3openalex-snapshot
Frame Inference for Inductive Entailment Proofs in Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-94111-0_3openalex-snapshot
Program Verification with Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_30openalex-snapshot
A Separation Logic with Data: Small Models and Automation
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_5openalex-snapshot
Backwards and Forwards with Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_24openalex-snapshot
Heap Decomposition for Concurrent Shape Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_18openalex-snapshot
Automated Verification of Shape and Size Properties Via Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_34openalex-snapshot
Enhancing Program Verification with Lemmas
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_36openalex-snapshot
Scalable Shape Analysis for Systems Code
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_8openalex-snapshot
Reasoning About Sequences of Memory States
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_22openalex-snapshot
Shape Analysis for Composite Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_15openalex-snapshot
Modular Safety Checking for Fine-Grained Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_26openalex-snapshot
Arithmetic Strengthening for Shape Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_6openalex-snapshot
Formalised Inductive Reasoning in the Logic of Bunched Implications
inferred← citeshttps://doi.org/10.1007/978-3-540-74105-3openalex-snapshot
Decision Procedures: An Algorithmic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_18openalex-snapshot
A Marriage of Rely/Guarantee and Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-75336-0openalex-snapshot
Trustworthy Global Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-87730-1_50openalex-snapshot
Diagrammatic Reasoning in Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-89330-1_1openalex-snapshot
Abductive Inference for Reasoning about Heaps
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_6openalex-snapshot
Separation Logic Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-642-00590-9_25openalex-snapshot
Automatic Parallelization with Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_6openalex-snapshot
Automatic Parallelization and Optimization of Programs by Proof Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-04570-7_1openalex-snapshot
Attacking Large Industrial Code with Bi-abductive Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-10672-9_19openalex-snapshot
Bi-abductive Resource Invariant Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_6openalex-snapshot
Amortised Resource Analysis with Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-12029-9_20openalex-snapshot
Memory Leaks Detection in Java by Bi-abductive Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-13464-7_14openalex-snapshot
Heap-Dependent Expressions in Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-15640-3_1openalex-snapshot
Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_13openalex-snapshot
A Shape Analysis for Non-linear Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-16164-3_2openalex-snapshot
Symbolic Object Code Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_21openalex-snapshot
A Quick Tour of the VeriFast Program Verifier
inferred← citeshttps://doi.org/10.1007/978-3-642-17796-5_9openalex-snapshot
Matching Logic: An Alternative to Hoare/Floyd Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-18275-4_25openalex-snapshot
Access Analysis-Based Tight Localization of Abstract Memories
inferred← citeshttps://doi.org/10.1007/978-3-642-21461-5_21openalex-snapshot
Annotation Inference for Separation Logic Based Verifiers
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_15openalex-snapshot
SLAyer: Memory Safety for Systems-Level Code
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_7openalex-snapshot
The Complexity of Abduction for Separated Heap Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_20openalex-snapshot
Mutation in Linked Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-25379-9_18openalex-snapshot
VeriSmall: Verified Smallfoot Shape Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_10openalex-snapshot
Crowfoot: A Verifier for Higher-Order Store Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-28891-3_29openalex-snapshot
Efficient Symbolic Execution of Value-Based Data Structures for Critical Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_16openalex-snapshot
Diagnosing Abstraction Failure for Separation Logic–Based Analyses
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_33openalex-snapshot
Towards a Unified Theory of Operational and Axiomatic Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-36946-9_14openalex-snapshot
VeriFast for Java: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_12openalex-snapshot
Ribbon Proofs for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_54openalex-snapshot
Automating Separation Logic Using SMT
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_24openalex-snapshot
Constraint-Based Program Reasoning with Heaps and Separation
inferred← citeshttps://doi.org/10.1007/978-3-662-48288-9_6openalex-snapshot
Shape Analysis for Unstructured Sharing
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_23openalex-snapshot
Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic
inferred← citeshttps://doi.org/10.1007/978-981-95-7826-9_8openalex-snapshot
Separation Logic with Heap Variables: A Decision Procedure and Its Application
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_13openalex-snapshot
Relative Completeness of Incorrectness Separation Logic
inferred← citeshttps://doi.org/10.1007/s00165-010-0148-1openalex-snapshot
Automatic verification of Java programs with dynamic frames
inferred← citeshttps://doi.org/10.1007/s00165-018-0455-5openalex-snapshot
Unifying separation logic and region logic to allow interoperability
inferred← citeshttps://doi.org/10.1007/s00165-018-0471-5openalex-snapshot
Automated mutual induction proof in separation logic
inferred← citeshttps://doi.org/10.1007/s10009-009-0118-1openalex-snapshot
A survey of new trends in symbolic execution for software testing and analysis
inferred← citeshttps://doi.org/10.1007/s10009-012-0256-8openalex-snapshot
Symbolic object code analysis
inferred← citeshttps://doi.org/10.1007/s10817-014-9319-8openalex-snapshot
Symbolic Execution Proofs for Higher Order Store Programs
inferred← citeshttps://doi.org/10.1007/s10817-018-9457-5openalex-snapshot
VST-Floyd: A Separation Logic Tool to Verify Correctness of C Programs
inferred← citeshttps://doi.org/10.1007/s11390-020-0536-9openalex-snapshot
Modular Verification of SPARCv8 Code
inferred← citeshttps://doi.org/10.1007/s11704-008-0033-8openalex-snapshot
Automated verification of pointer programs in pointer logic
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.004openalex-snapshot
Reasoning about sequences of memory states
inferred← citeshttps://doi.org/10.1016/j.cl.2015.08.004openalex-snapshot
Symbolic execution based on language transformation
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.09.057openalex-snapshot
Separation Logic Verification of C Programs with an SMT Solver
inferred← citeshttps://doi.org/10.1016/j.ic.2019.03.002openalex-snapshot
Completeness and expressiveness of pointer program verification by separation logic
inferred← citeshttps://doi.org/10.1016/j.infsof.2015.05.007openalex-snapshot
Goal-oriented dynamic test generation
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.06.003openalex-snapshot
Verifying pointer safety for programs with unknown calls
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.04.001openalex-snapshot
Invariant functions and invariant relations: An alternative to invariant assertions
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.07.012openalex-snapshot
A generic framework for symbolic execution: A coinductive approach
inferred← citeshttps://doi.org/10.1016/j.scico.2010.07.004openalex-snapshot
Automated verification of shape, size and bag properties via user-defined predicates in separation logic
inferred← citeshttps://doi.org/10.1016/j.scico.2013.01.006openalex-snapshot
Software verification with VeriFast: Industrial case studies
inferred← citeshttps://doi.org/10.1016/j.scico.2013.04.002openalex-snapshot
Access-based abstract memory localization in static analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2021.102687openalex-snapshot
Combining state- and event-based semantics to verify highly available applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.003openalex-snapshot
A program logic for resources
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.004openalex-snapshot
Completeness for recursive procedures in separation logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.09.025openalex-snapshot
Verify heaps via unified model checking
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115372openalex-snapshot
Expressive completeness of separation logic in block-based cloud storage systems
inferred← citeshttps://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
inferred← citeshttps://doi.org/10.1093/logcom/exn066openalex-snapshot
Tableaux and Resource Graphs for Separation Logic
inferred← citeshttps://doi.org/10.1109/ase.2006.26openalex-snapshot
Bogor/Kiasan: A k-bounded Symbolic Execution for Checking Strong Heap Properties of Open Systems
inferred← citeshttps://doi.org/10.1109/ase.2006.69openalex-snapshot
Towards Automatic Assertion Refinement for Separation Logic
inferred← citeshttps://doi.org/10.1109/ase.2011.6100049openalex-snapshot
Safe asynchronous multicore memory operations
inferred← citeshttps://doi.org/10.1109/fruct-ispit.2016.7561510openalex-snapshot
Abstract predicate entailment over points-to heaplets is syntax recognition
inferred← citeshttps://doi.org/10.1109/hase.2007.19openalex-snapshot
Multiple Pre/Post Specifications for Heap-Manipulating Methods
inferred← citeshttps://doi.org/10.1109/hase.2007.56openalex-snapshot
CROWN-C: A High-Assurance Service-Oriented Grid Middleware System
inferred← citeshttps://doi.org/10.1109/icdew.2011.5767624openalex-snapshot
Formal reasoning about runtime code update
inferred← citeshttps://doi.org/10.1109/iceccs.2007.17openalex-snapshot
Automated Verification of Shape, Size and Bag Properties
inferred← citeshttps://doi.org/10.1109/iceccs.2019.00031openalex-snapshot
Bi-Abductive Inference for Shape and Ordering Properties
inferred← citeshttps://doi.org/10.1109/icis.2012.86openalex-snapshot
Polynomial Constraint Satisfaction Utilizing Adaptive Dynamic Domain Reduction
inferred← citeshttps://doi.org/10.1109/icycs.2008.168openalex-snapshot
Implementation of Pointer Logic for Automated Verification
inferred← citeshttps://doi.org/10.1109/lics.2015.11openalex-snapshot
From Categorical Logic to Facebook Engineering
inferred← citeshttps://doi.org/10.1109/qrs.2015.19openalex-snapshot
Node-Set Analysis for Linked Recursive Data Structures
inferred← citeshttps://doi.org/10.1109/sefm.2006.24openalex-snapshot
Harnessing Disruptive Innovation in Formal Verification
inferred← citeshttps://doi.org/10.1109/sefm.2009.33openalex-snapshot
Completeness of Pointer Program Verification by Separation Logic
inferred← citeshttps://doi.org/10.1109/sew.2007.51openalex-snapshot
Abstracting Pointers for a Verifying Compiler
inferred← citeshttps://doi.org/10.1109/sew.2007.89openalex-snapshot
Abstracting Pointers for a Verifying Compiler
inferred← citeshttps://doi.org/10.1109/tase.2008.13openalex-snapshot
An Extension to Pointer Logic for Verification
inferred← citeshttps://doi.org/10.1109/tase.2010.8openalex-snapshot
A Certifying Compiler for Clike Subset of C Language
inferred← citeshttps://doi.org/10.1109/tkde.2018.2810144openalex-snapshot
Planning with Spatio-Temporal Search Control Knowledge
inferred← citeshttps://doi.org/10.11185/imt.4.304openalex-snapshot
A Certified Verifier for a Fragment of Separation Logic
inferred← citeshttps://doi.org/10.11309/jssst.37.1_125openalex-snapshot
Spatial Factorization in Cyclic-Proof System for Separation Logic
inferred← citeshttps://doi.org/10.1145/1040305.1040328openalex-snapshot
Context logic and tree update
inferred← citeshttps://doi.org/10.1145/1250734.1250764openalex-snapshot
Shape analysis with inductive recursion synthesis
inferred← citeshttps://doi.org/10.1145/1250734.1250765openalex-snapshot
Thread-modular shape analysis
inferred← citeshttps://doi.org/10.1145/1273442.1250764openalex-snapshot
Shape analysis with inductive recursion synthesis
inferred← citeshttps://doi.org/10.1145/1273442.1250765openalex-snapshot
Thread-modular shape analysis
inferred← citeshttps://doi.org/10.1145/1328438.1328453openalex-snapshot
Cyclic proofs of program termination in separation logic
inferred← citeshttps://doi.org/10.1145/1328897.1328453openalex-snapshot
Cyclic proofs of program termination in separation logic
inferred← citeshttps://doi.org/10.1145/1345169.1345175openalex-snapshot
Cooperative reasoning for automatic software verification
inferred← citeshttps://doi.org/10.1145/1377492.1377499openalex-snapshot
Local reasoning about a copying garbage collector
inferred← citeshttps://doi.org/10.1145/1480881.1480917openalex-snapshot
Compositional shape analysis by means of bi-abduction
inferred← citeshttps://doi.org/10.1145/1594834.1480917openalex-snapshot
Compositional shape analysis by means of bi-abduction
inferred← citeshttps://doi.org/10.1145/1745312.1745315openalex-snapshot
Verifying safety properties of concurrent heap-manipulating programs
inferred← citeshttps://doi.org/10.1145/1925844.1926406openalex-snapshot
Calling context abstraction with shapes
inferred← citeshttps://doi.org/10.1145/1926385.1926406openalex-snapshot
Calling context abstraction with shapes
inferred← citeshttps://doi.org/10.1145/1929553.1929559openalex-snapshot
Extended alias type system using separating implication
inferred← citeshttps://doi.org/10.1145/1993316.1993563openalex-snapshot
Separation logic + superposition calculus = heap theorem prover
inferred← citeshttps://doi.org/10.1145/1993498.1993563openalex-snapshot
Separation logic + superposition calculus = heap theorem prover
inferred← citeshttps://doi.org/10.1145/2049697.2049700openalex-snapshot
Compositional Shape Analysis by Means of Bi-Abduction
inferred← citeshttps://doi.org/10.1145/2103621.2103673openalex-snapshot
Recursive proofs for inductive tree data-structures
inferred← citeshttps://doi.org/10.1145/2103656.2103673openalex-snapshot
Recursive proofs for inductive tree data-structures
inferred← citeshttps://doi.org/10.1145/2429069.2429095openalex-snapshot
A theorem prover for Boolean BI
inferred← citeshttps://doi.org/10.1145/2480359.2429095openalex-snapshot
A theorem prover for Boolean BI
inferred← citeshttps://doi.org/10.1145/2485982openalex-snapshot
Local Reasoning for Global Invariants, Part I
inferred← citeshttps://doi.org/10.1145/2491522.2491525openalex-snapshot
Proof-Directed Parallelization Synthesis by Separation Logic
inferred← citeshttps://doi.org/10.1145/2491956.2462169openalex-snapshot
Natural proofs for structure, data, and separation
inferred← citeshttps://doi.org/10.1145/2499370.2462169openalex-snapshot
Natural proofs for structure, data, and separation
inferred← citeshttps://doi.org/10.1145/2535838.2535864openalex-snapshot
Proof search for propositional abstract separation logics via labelled sequents
inferred← citeshttps://doi.org/10.1145/2535838.2535871openalex-snapshot
A proof system for separation logic with magic wand
inferred← citeshttps://doi.org/10.1145/2535838.2535878openalex-snapshot
An operational and axiomatic semantics for non-determinism and sequence points in C
inferred← citeshttps://doi.org/10.1145/2578855.2535864openalex-snapshot
Proof search for propositional abstract separation logics via labelled sequents
inferred← citeshttps://doi.org/10.1145/2578855.2535871openalex-snapshot
A proof system for separation logic with magic wand
inferred← citeshttps://doi.org/10.1145/2578855.2535878openalex-snapshot
An operational and axiomatic semantics for non-determinism and sequence points in C
inferred← citeshttps://doi.org/10.1145/2594291.2594325openalex-snapshot
Natural proofs for data structure manipulation in C using separation logic
showing the first 200 of 286 · page through all 286
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.