On the public citation graph
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
0 signed · 336 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/11561163_11openalex-snapshot
Assertion-Based Encapsulation, Object Invariants and Simulations
inferredcites →https://doi.org/10.1007/11575467_5openalex-snapshot
Symbolic Execution with Separation Logic
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-44898-5_4openalex-snapshot
Checking Interference with Fractional Permissions
inferredcites →https://doi.org/10.1007/3-540-45332-6_7openalex-snapshot
Alias Types for Recursive Data Structures
inferredcites →https://doi.org/10.1007/3-540-45337-7_4openalex-snapshot
Simple Ownership Types for Object Containment
inferredcites →https://doi.org/10.1007/3-540-45927-8_19openalex-snapshot
Thread-Modular Verification for Shared-Memory Programs
inferredcites →https://doi.org/10.1007/3-540-45931-6_28openalex-snapshot
A Semantic Basis for Local Reasoning
inferredcites →https://doi.org/10.1007/978-0-387-21798-7_1openalex-snapshot
Wanted: a compositional approach to concurrency
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0openalex-snapshot
The Origin of Concurrent Programming
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_6openalex-snapshot
Towards a Theory of Parallel Programming
inferredcites →https://doi.org/10.1007/978-3-540-24851-4_22openalex-snapshot
Object Invariants in Dynamic Contexts
inferredcites →https://doi.org/10.1007/978-3-540-27764-4_5openalex-snapshot
Friends Need a Bit More: Maintaining Invariants Over Shared State
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_2openalex-snapshot
A Semantics for Concurrent Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-28644-8_4openalex-snapshot
Resources, Concurrency and Local Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-30569-9_3openalex-snapshot
The Spec# Programming System: An Overview
inferredcites →https://doi.org/10.1007/bfb0059696openalex-snapshot
Procedures and parameters: An axiomatic approach
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.034openalex-snapshot
A semantics for concurrent separation logic
inferredcites →https://doi.org/10.1016/j.tcs.2006.12.035openalex-snapshot
Resources, concurrency, and local reasoning
inferredcites →https://doi.org/10.1093/comjnl/20.2.151openalex-snapshot
Generic commands--a tool for partial correctness formalisms
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1109/sefm.2005.39openalex-snapshot
Safe concurrency for aggregate objects with invariants
inferredcites →https://doi.org/10.1109/tpds.2004.8openalex-snapshot
Hazard pointers: safe memory reclamation for lock-free objects
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1145/1040305.1040327openalex-snapshot
Permission accounting in separation logic
inferredcites →https://doi.org/10.1145/1040305.1040330openalex-snapshot
A semantics for procedure local heaps and its abstractions
inferredcites →https://doi.org/10.1145/1101821.1101824openalex-snapshot
Ownership confinement ensures representation independence for object-oriented programs
inferredcites →https://doi.org/10.1145/258915.258936openalex-snapshot
Automatic verification of pointer programs using monadic second-order logic
inferredcites →https://doi.org/10.1145/378795.378811openalex-snapshot
Enforcing high-level protocols in low-level software
inferredcites →https://doi.org/10.1145/378795.378851openalex-snapshot
The pointer assertion logic engine
inferredcites →https://doi.org/10.1145/381694.378811openalex-snapshot
Enforcing high-level protocols in low-level software
inferredcites →https://doi.org/10.1145/381694.378851openalex-snapshot
The pointer assertion logic engine
inferredcites →https://doi.org/10.1145/512529.512558openalex-snapshot
Extended static checking for Java
inferredcites →https://doi.org/10.1145/512529.512559openalex-snapshot
Using data groups to specify and check side effects
inferredcites →https://doi.org/10.1145/514188.514190openalex-snapshot
Parametric shape analysis via 3-valued logic
inferredcites →https://doi.org/10.1145/964001.964020openalex-snapshot
Local reasoning about a copying garbage collector
inferredcites →https://doi.org/10.1145/964001.964024openalex-snapshot
Separation and information hiding
inferredcites →https://doi.org/10.1145/982962.964024openalex-snapshot
Separation and information hiding
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
inferredcites →https://doi.org/10.25405/ncl.34125705openalex-snapshot
Specification and Design of (Parallel) Programs
inferredcites →https://doi.org/10.5381/jot.2004.3.6.a2openalex-snapshot
Verification of Object-Oriented Programs with Invariants.
inferredcites →https://doi.org/10.5381/jot.2005.4.8.a1openalex-snapshot
Universes: Lightweight Ownership for JML.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11575467_5openalex-snapshot
Symbolic Execution with Separation Logic
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/978-1-84882-736-3_7openalex-snapshot
Separation Logic and Concurrency
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-44914-8_19openalex-snapshot
A First-Order Logic with Frames
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_14openalex-snapshot
Local Reasoning About the Presence of Bugs: Incorrectness Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-55754-6_10openalex-snapshot
Formal Verification of Parallel Prefix Sum
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-81688-9_35openalex-snapshot
An SMT Encoding of LLVM’s Memory Model for Bounded Translation Validation
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_37openalex-snapshot
Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_22openalex-snapshot
Concise Outlines for a Complex Logic: A Proof Outline Checker for TaDA
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-030-99527-0_18openalex-snapshot
Alpinist: An Annotation-Aware GPU Program Optimizer
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-43513-3_23openalex-snapshot
Testing the Satisfiability of Formulas in Separation Logic with Permissions
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_18openalex-snapshot
Verification Algorithms for Automated Separation Logic Verifiers
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-98668-0_1openalex-snapshot
Verifying Tree-Manipulating Programs via CHCs
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_12openalex-snapshot
Automatic Heap-Memory Diagrams for Separation-Logic Proofs
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-06686-8_10openalex-snapshot
Separation Logic with One Quantified Variable
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_5openalex-snapshot
Verification of Concurrent Systems with VerCors
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_6openalex-snapshot
Combining Monitoring with Run-Time Assertion Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_41openalex-snapshot
LEAP: A Tool for the Parametrized Verification of Concurrent Datatypes
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_47openalex-snapshot
Automating Separation Logic with Trees and Data
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_24openalex-snapshot
Compositional Computational Reflection
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-12736-1_17openalex-snapshot
Compositional Entailment Checking for a Fragment of Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-17524-9_1openalex-snapshot
Moving Fast with Software Verification
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-25423-4_23openalex-snapshot
Specifying Compatible Sharing in Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-33693-0_29openalex-snapshot
Verifying Pointer Programs Using Separation Logic and Invariant Based Programming in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-319-41528-4_22openalex-snapshot
Automatic Verification of Iterated Separating Conjunctions Using Symbolic Execution
inferred← citeshttps://doi.org/10.1007/978-3-319-45943-1_4openalex-snapshot
One Step Towards Automatic Inference of Formal Specifications Using Automated VeriFast
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-52234-0_3openalex-snapshot
Effective Bug Finding in C Programs with Shape and Effect Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_2openalex-snapshot
Towards Logic-Based Verification of JavaScript Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_2openalex-snapshot
Program Verification Under Weak Memory Consistency Using Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-64021-1_3openalex-snapshot
Overview of Formal Methods
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-89366-2_24openalex-snapshot
Modular Tableaux Calculi for Separation Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_26openalex-snapshot
The Effects of Adding Reachability Predicates in Propositional Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_7openalex-snapshot
Permission Inference for Array Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_33openalex-snapshot
Nagini: A Static Verifier for Python
inferred← citeshttps://doi.org/10.1007/978-3-319-99725-4_16openalex-snapshot
Modular Static Analysis of String Manipulations in C Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-68863-1_14openalex-snapshot
VeriCool: An Automatic Verifier for a Concurrent Object-Oriented Language
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_14openalex-snapshot
Scalable Specification and Reasoning: Challenges for Program Logic
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-69738-1_8openalex-snapshot
An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_5openalex-snapshot
Tutorial on Separation Logic (Invited Tutorial)
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_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-78163-9_19openalex-snapshot
Runtime Checking for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_15openalex-snapshot
Footprints in Local Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_16openalex-snapshot
Separation Logic Contracts for a Java-Like Language with Fork/Join
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-00515-2_1openalex-snapshot
Space Invading Systems Code
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-00590-9_27openalex-snapshot
A Basis for Verifying Multi-threaded Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_30openalex-snapshot
Beyond Shapes: Lists with Ordered Data
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_30openalex-snapshot
Verifying Reference Counting Implementations
inferred← citeshttps://doi.org/10.1007/978-3-642-02047-6_4openalex-snapshot
Aliasing, Confinement, and Ownership in Object-Oriented Programming
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-03359-9_24openalex-snapshot
Practical Tactics for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_32openalex-snapshot
A Formalisation of Smallfoot in HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-03829-7_7openalex-snapshot
Verification of Concurrent Programs with Chalice
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_14openalex-snapshot
Memory Usage Verification Using Hip/Sleek
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_40openalex-snapshot
Reasoning about Memory Layouts
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-12002-2_23openalex-snapshot
Tracking Heaps That Hop with Heap-Hop
inferred← citeshttps://doi.org/10.1007/978-3-642-14458-5_11openalex-snapshot
Small Specifications for Tree Update
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_31openalex-snapshot
Loop Invariant Synthesis in a Combined Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-19829-8_11openalex-snapshot
Reasoning about Assignments in Recursive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-20920-8_10openalex-snapshot
Hoare Logic for Higher Order Store Using Simple Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-21070-9_11openalex-snapshot
Variable Side Conditions and Greatest Relations in Algebraic Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_14openalex-snapshot
The 1st Verified Software Competition: Experience Report
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_28openalex-snapshot
Automatically Refining Partial Specifications for Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_29openalex-snapshot
Structured Specifications for Better Verification of Heap-Manipulating Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_30openalex-snapshot
Verification of Unloadable Modules
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-22953-4_27openalex-snapshot
Specification Patterns and Proofs for Recursion through the Store
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_16openalex-snapshot
Tractable Reasoning in a Fragment of Separation Logic
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-24559-6_33openalex-snapshot
Developer-Oriented Correctness Proofs
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-27705-4_16openalex-snapshot
Comparing Verification Condition Generation with Symbolic Execution: An Experience Report
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-31762-0_10openalex-snapshot
Juggrnaut – An Abstract JVM
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_14openalex-snapshot
Separation Predicates: A Taste of Separation Logic in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_4openalex-snapshot
Variable Permissions for Concurrency Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-36946-9_7openalex-snapshot
Alias Control for Deterministic Parallelism
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-37036-6_9openalex-snapshot
Compositional Invariant Checking for Overlaid and Nested Linked Lists
inferred← citeshttps://doi.org/10.1007/978-3-642-39038-8_19openalex-snapshot
Verification Condition Generation for Permission Logics with Abstract Predicates and Abstraction Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-39038-8_6openalex-snapshot
A Formal Semantics for Isorecursive and Equirecursive State Abstractions
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-49122-5_2openalex-snapshot
Viper: A Verification Infrastructure for Permission-Based Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-662-49122-5_3openalex-snapshot
Predicate Abstraction for Linked Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_10openalex-snapshot
Temporary Read-Only Permissions for Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_16openalex-snapshot
Caper: automatic verification for fine-grained concurrency
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/s00165-018-0455-5openalex-snapshot
Unifying separation logic and region logic to allow interoperability
inferred← citeshttps://doi.org/10.1007/s00224-016-9713-1openalex-snapshot
Separation Logic with One Quantified Variable
inferred← citeshttps://doi.org/10.1007/s10009-014-0306-5openalex-snapshot
Expressive program verification via structured specifications
inferred← citeshttps://doi.org/10.1007/s10009-014-0307-4openalex-snapshot
Automated verification of the FreeRTOS scheduler in Hip/Sleek
inferred← citeshttps://doi.org/10.1007/s10009-014-0327-0openalex-snapshot
Program verification and testing technologies
inferred← citeshttps://doi.org/10.1007/s10009-015-0372-3openalex-snapshot
Witnessing the elimination of magic wands
inferred← citeshttps://doi.org/10.1007/s10270-014-0446-9openalex-snapshot
Integrating deductive verification and symbolic execution for abstract object creation in dynamic logic
inferred← citeshttps://doi.org/10.1007/s10515-011-0089-9openalex-snapshot
Efficient and formal generalized symbolic execution
inferred← citeshttps://doi.org/10.1007/s10515-012-0113-8openalex-snapshot
Verification of complex dynamic data tree with mu-calculus
inferred← citeshttps://doi.org/10.1007/s10703-010-0098-5openalex-snapshot
Reasoning about memory layouts
inferred← citeshttps://doi.org/10.1007/s10703-015-0236-1openalex-snapshot
Juggrnaut: using graph grammars for abstracting unbounded heap structures
inferred← citeshttps://doi.org/10.1007/s10703-017-0289-4openalex-snapshot
Compositional entailment checking for a fragment of separation logic
inferred← citeshttps://doi.org/10.1007/s10703-023-00427-wopenalex-snapshot
Concise outlines for a complex logic: a proof outline checker for TaDA
inferred← citeshttps://doi.org/10.1007/s10703-025-00480-7openalex-snapshot
Preserving provability over GPU program optimizations with annotation-aware transformations
inferred← citeshttps://doi.org/10.1007/s10817-009-9118-9openalex-snapshot
Certifying Low-Level Programs with Hardware Interrupts and Preemptive Threads
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/s11390-013-1398-1openalex-snapshot
A Shape Graph Logic and A Shape System
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.1007/s13218-024-00855-8openalex-snapshot
Challenges for Non-Classical Reasoning in Contemporary AI Applications
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.entcs.2007.02.006openalex-snapshot
Local Reasoning about Data Update
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.05.010openalex-snapshot
MatchC: A Matching Logic Reachability Verifier Using the K Framework
inferred← citeshttps://doi.org/10.1016/j.ic.2013.08.011openalex-snapshot
Specification patterns for reasoning about recursion through the store
inferred← citeshttps://doi.org/10.1016/j.scico.2013.03.004openalex-snapshot
Automatically refining partial specifications for heap-manipulating programs
inferred← citeshttps://doi.org/10.1016/j.scico.2014.06.004openalex-snapshot
Static analysis of lists by combining shape and numerical abstractions
inferred← citeshttps://doi.org/10.1017/cbo9781107256552openalex-snapshot
Program Logics for Certified Compilers
inferred← citeshttps://doi.org/10.1017/s147106841800025xopenalex-snapshot
Shape Neutral Analysis of Graph-based Data-structures
inferred← citeshttps://doi.org/10.1080/11663081.2015.1018801openalex-snapshot
Separation logics and modalities: a survey
inferred← citeshttps://doi.org/10.1093/logcom/exn066openalex-snapshot
Tableaux and Resource Graphs for Separation Logic
inferred← citeshttps://doi.org/10.1093/logcom/exu032openalex-snapshot
Proof automation for functional correctness in separation logic
inferred← citeshttps://doi.org/10.1109/ase.2011.6100049openalex-snapshot
Safe asynchronous multicore memory operations
inferred← citeshttps://doi.org/10.1109/ase.2011.6100132openalex-snapshot
The CORE system: Animation and functional correctness of pointer programs
inferred← citeshttps://doi.org/10.1109/ase.2017.8115646openalex-snapshot
DSIbin: Identifying dynamic data structures in C/C++ binaries
inferred← citeshttps://doi.org/10.1109/fose.2007.6openalex-snapshot
Formal Software Analysis Emerging Trends in Software Model Checking
inferred← citeshttps://doi.org/10.1109/iccp.2015.7312614openalex-snapshot
Verification of protocol specifications with Separation Logic
inferred← citeshttps://doi.org/10.1109/iceccs.2007.17openalex-snapshot
Automated Verification of Shape, Size and Bag Properties
inferred← citeshttps://doi.org/10.1109/icsa-c63560.2024.00054openalex-snapshot
Towards Integration of Syntactic and Semantic Vulnerability Patterns
inferred← citeshttps://doi.org/10.1109/icsme55016.2022.00028openalex-snapshot
On the Security of Python Virtual Machines: An Empirical Study
inferred← citeshttps://doi.org/10.1109/icycs.2008.168openalex-snapshot
Implementation of Pointer Logic for Automated Verification
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536430openalex-snapshot
Verifying linked data structure implementations
inferred← citeshttps://doi.org/10.1109/lics.2006.52openalex-snapshot
Variables as Resource in Hoare Logics
inferred← citeshttps://doi.org/10.1109/lics.2007.30openalex-snapshot
Local Action and Abstract Separation Logic
inferred← citeshttps://doi.org/10.1109/lics.2015.11openalex-snapshot
From Categorical Logic to Facebook Engineering
inferred← citeshttps://doi.org/10.1109/tase.2008.13openalex-snapshot
An Extension to Pointer Logic for Verification
inferred← citeshttps://doi.org/10.1109/tase.2009.17openalex-snapshot
The Logical Approach to Low-Level Stack Reasoning
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/tase.2012.45openalex-snapshot
Automated Verification of the FreeRTOS Scheduler in HIP/SLEEK
inferred← citeshttps://doi.org/10.1109/tase49443.2020.00011openalex-snapshot
A Novel Data-Driven Approach for Generating Verified Loop Invariants
inferred← citeshttps://doi.org/10.1109/tase52547.2021.00025openalex-snapshot
Encoding Induction Proof in Dafny
inferred← citeshttps://doi.org/10.1109/tdsc.2019.2928541openalex-snapshot
S The Security MicroVisor: A Formally-Verified Software-Based Security Architecture for the Internet of Things
inferred← citeshttps://doi.org/10.1145/1181195.1181213openalex-snapshot
Reasoning about iterators with separation logic
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/1375581.1375624openalex-snapshot
Full functional verification of linked data structures
inferred← citeshttps://doi.org/10.1145/1376916.1376953openalex-snapshot
Local Hoare reasoning about DOM
inferred← citeshttps://doi.org/10.1145/1379022.1375624openalex-snapshot
Full functional verification of linked data structures
inferred← citeshttps://doi.org/10.1145/1411203.1411235openalex-snapshot
Functional translation of a calculus of capabilities
inferred← citeshttps://doi.org/10.1145/1480881.1480917openalex-snapshot
Compositional shape analysis by means of bi-abduction
inferred← citeshttps://doi.org/10.1145/1529282.1529402openalex-snapshot
Local reasoning for abstraction and sharing
inferred← citeshttps://doi.org/10.1145/1596550.1596565openalex-snapshot
Effective interactive proofs for higher-order imperative programs
inferred← citeshttps://doi.org/10.1145/1631687.1596565openalex-snapshot
Effective interactive proofs for higher-order imperative programs
inferred← citeshttps://doi.org/10.1145/1667048.1667050openalex-snapshot
A relational approach to interprocedural shape analysis
inferred← citeshttps://doi.org/10.1145/1706299.1706331openalex-snapshot
Structuring the verification of heap-manipulating programs
inferred← citeshttps://doi.org/10.1145/1707801.1706331openalex-snapshot
Structuring the verification of heap-manipulating programs
inferred← citeshttps://doi.org/10.1145/1993316.1993526openalex-snapshot
Mostly-automated verification of low-level programs in computational separation logic
inferred← citeshttps://doi.org/10.1145/1993316.1993563openalex-snapshot
Separation logic + superposition calculus = heap theorem prover
inferred← citeshttps://doi.org/10.1145/1993498.1993526openalex-snapshot
Mostly-automated verification of low-level programs in computational separation logic
inferred← citeshttps://doi.org/10.1145/1993498.1993563openalex-snapshot
Separation logic + superposition calculus = heap theorem prover
inferred← citeshttps://doi.org/10.1145/2034574.2034828openalex-snapshot
Characteristic formulae for the verification of imperative programs
inferred← citeshttps://doi.org/10.1145/2034773.2034828openalex-snapshot
Characteristic formulae for the verification of imperative programs
inferred← citeshttps://doi.org/10.1145/2048066.2048096openalex-snapshot
Immutable specifications for more concise and precise verification
inferred← citeshttps://doi.org/10.1145/2049697.2049700openalex-snapshot
Compositional Shape Analysis by Means of Bi-Abduction
inferred← citeshttps://doi.org/10.1145/2076021.2048096openalex-snapshot
Immutable specifications for more concise and precise verification
inferred← citeshttps://doi.org/10.1145/2103621.2103663openalex-snapshot
Towards a program logic for JavaScript
inferred← citeshttps://doi.org/10.1145/2103621.2103694openalex-snapshot
Resource-sensitive synchronization inference by abduction
inferred← citeshttps://doi.org/10.1145/2103621.2103695openalex-snapshot
Syntactic control of interference for separation logic
inferred← citeshttps://doi.org/10.1145/2103656.2103663openalex-snapshot
Towards a program logic for JavaScript
inferred← citeshttps://doi.org/10.1145/2103656.2103694openalex-snapshot
Resource-sensitive synchronization inference by abduction
inferred← citeshttps://doi.org/10.1145/2103656.2103695openalex-snapshot
Syntactic control of interference for separation logic
inferred← citeshttps://doi.org/10.1145/2187671.2187678openalex-snapshot
Behavioral interface specification languages
inferred← citeshttps://doi.org/10.1145/2318202.2318208openalex-snapshot
Verifying the reflective visitor pattern
inferred← citeshttps://doi.org/10.1145/2364527.2364531openalex-snapshot
Verified heap theorem prover by paramodulation
inferred← citeshttps://doi.org/10.1145/2398856.2364531openalex-snapshot
Verified heap theorem prover by paramodulation
inferred← citeshttps://doi.org/10.1145/2429069.2429095openalex-snapshot
A theorem prover for Boolean BI
inferred← citeshttps://doi.org/10.1145/2429069.2429131openalex-snapshot
The ramifications of sharing in data structures
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
showing the first 200 of 292 · page through all 292
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.