On the public citation graph

MoSeL: a general, extensible modal framework for interactive proofs in separation logic

0 signed · 145 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_6openalex-snapshot

Smallfoot: Modular Automatic Assertion Checking with Separation Logic

inferredcites →https://doi.org/10.1007/3-540-10843-2_22openalex-snapshot

Impartiality, justice and fairness: The ethics of concurrent termination

inferredcites →https://doi.org/10.1007/3-540-44404-1_7openalex-snapshot

A Tactic Language for the System Coq

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/978-3-319-71237-6_10openalex-snapshot

Bringing Order to the Separation Logic Jungle

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-3-540-71067-7_23openalex-snapshot

First-Class Type Classes

inferredcites →https://doi.org/10.1007/978-3-540-74407-8_18openalex-snapshot

A Marriage of Rely/Guarantee and Separation Logic

inferredcites →https://doi.org/10.1007/978-3-642-03359-9_23openalex-snapshot

Packaging Mathematical Structures

inferredcites →https://doi.org/10.1007/978-3-642-03359-9_24openalex-snapshot

Practical Tactics for Separation Logic

inferredcites →https://doi.org/10.1007/978-3-642-10672-9_13openalex-snapshot

A Fresh Look at Separation Algebras and Share Accounting

inferredcites →https://doi.org/10.1007/978-3-642-32347-8_21openalex-snapshot

Charge! - A Framework for Higher-Order Separation Logic in Coq

inferredcites →https://doi.org/10.1007/978-3-662-44202-9_9openalex-snapshot

TaDA: A Logic for Time and Data Abstraction

inferredcites →https://doi.org/10.1007/978-3-662-46669-8_14openalex-snapshot

Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity

inferredcites →https://doi.org/10.1007/978-3-662-54434-1_10openalex-snapshot

Temporary Read-Only Permissions for Separation Logic

inferredcites →https://doi.org/10.1007/978-3-662-54434-1_26openalex-snapshot

The Essence of Higher-Order Concurrent Separation Logic

inferredcites →https://doi.org/10.1007/978-3-662-54434-1_34openalex-snapshot

A Higher-Order Logic for Concurrent Termination-Preserving Refinement

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.1007/s10817-018-9457-5openalex-snapshot

VST-Floyd: A Separation Logic Tool to Verify Correctness of C Programs

inferredcites →https://doi.org/10.1016/j.entcs.2008.10.002openalex-snapshot

Multimodal Separation Logic for Reasoning About Operational Semantics

inferredcites →https://doi.org/10.1016/j.entcs.2018.03.016openalex-snapshot

On Models of Higher-Order Separation Logic

inferredcites →https://doi.org/10.1016/j.tcs.2003.11.020openalex-snapshot

Possible worlds and resources: the semantics of BI

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.1016/j.tcs.2016.04.040openalex-snapshot

A logic of separating modalities

inferredcites →https://doi.org/10.1017/s0956796812000366openalex-snapshot

Syntactic soundness proof of a type-and-capability system with hidden state

inferredcites →https://doi.org/10.1017/s0960129511000119openalex-snapshot

Type classes for mathematics in type theory

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/lics.2007.30openalex-snapshot

Local Action and Abstract Separation Logic

inferredcites →https://doi.org/10.1145/1190215.1190234openalex-snapshot

Types, bytes, and separation logic

inferredcites →https://doi.org/10.1145/1190216.1190234openalex-snapshot

Types, bytes, and separation logic

inferredcites →https://doi.org/10.1145/1706299.1706331openalex-snapshot

Structuring the verification of heap-manipulating programs

inferredcites →https://doi.org/10.1145/2034574.2034828openalex-snapshot

Characteristic formulae for the verification of imperative programs

inferredcites →https://doi.org/10.1145/2429069.2429105openalex-snapshot

High-level separation logic for low-level code

inferredcites →https://doi.org/10.1145/2429069.2429131openalex-snapshot

The ramifications of sharing in data structures

inferredcites →https://doi.org/10.1145/2480359.2429131openalex-snapshot

The ramifications of sharing in data structures

inferredcites →https://doi.org/10.1145/2500365.2500592openalex-snapshot

The bedrock structured programming system

inferredcites →https://doi.org/10.1145/2500365.2500600openalex-snapshot

Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency

inferredcites →https://doi.org/10.1145/2544174.2500592openalex-snapshot

The bedrock structured programming system

inferredcites →https://doi.org/10.1145/2544174.2500600openalex-snapshot

Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency

inferredcites →https://doi.org/10.1145/2676726.2676980openalex-snapshot

Iris

inferredcites →https://doi.org/10.1145/2737924.2737964openalex-snapshot

Mechanized verification of fine-grained concurrent programs

inferredcites →https://doi.org/10.1145/2813885.2737964openalex-snapshot

Mechanized verification of fine-grained concurrent programs

inferredcites →https://doi.org/10.1145/2815400.2815402openalex-snapshot

Using Crash Hoare logic for certifying the FSCQ file system

inferredcites →https://doi.org/10.1145/2951913.2951943openalex-snapshot

Higher-order ghost state

inferredcites →https://doi.org/10.1145/3009837.3009855openalex-snapshot

Interactive proofs in higher-order concurrent separation logic

inferredcites →https://doi.org/10.1145/3022670.2951943openalex-snapshot

Higher-order ghost state

inferredcites →https://doi.org/10.1145/3093333.3009855openalex-snapshot

Interactive proofs in higher-order concurrent separation logic

inferredcites →https://doi.org/10.1145/3133913openalex-snapshot

Robust and compositional verification of object capability patterns

inferredcites →https://doi.org/10.1145/3158152openalex-snapshot

A logical relation for monadic encapsulation of state: proving contextual equivalences in the presence of runST

inferredcites →https://doi.org/10.1145/3158154openalex-snapshot

RustBelt: securing the foundations of the Rust programming language

inferredcites →https://doi.org/10.2307/421090openalex-snapshot

The Logic of Bunched Implications

inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.17openalex-snapshot

Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← backgroundhttps://doi.org/10.5281/zenodo.1306030zenodo-depositor-declared

Mosel: A General, Extensible Modal Framework For Interactive Proofs In Separation Logic -- Artifact

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-76920-8_5openalex-snapshot

An Algebraic Glimpse at Bunched Implications and Separation Logic

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-031-13188-2_7openalex-snapshot

Sound Automation of Magic Wands

inferred← citeshttps://doi.org/10.1007/978-3-031-21213-0_13openalex-snapshot

LOGIC: A Coq Library for Logics

inferred← citeshttps://doi.org/10.1007/978-3-031-47963-2_10openalex-snapshot

Interactive Matching Logic Proofs in Coq

inferred← citeshttps://doi.org/10.1007/978-3-031-95589-1openalex-snapshot

Coordination Models and Languages

inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_4openalex-snapshot

Raven: An SMT-Based Concurrency Verifier

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.1017/s0956796818000151openalex-snapshot

Iris from the ground up: A modular foundation for higher-order concurrent separation logic

inferred← citeshttps://doi.org/10.1109/sp40001.2021.00003openalex-snapshot

Compositional Non-Interference for Fine-Grained Concurrent Programs

inferred← citeshttps://doi.org/10.1145/3290378openalex-snapshot

Iron: managing obligations in higher-order concurrent separation logic

inferred← citeshttps://doi.org/10.1145/3371074openalex-snapshot

Actris: session-type based reasoning in separation logic

inferred← citeshttps://doi.org/10.1145/3371102openalex-snapshot

RustBelt meets relaxed memory

inferred← citeshttps://doi.org/10.1145/3371113openalex-snapshot

The future is ours: prophecy variables in separation logic

inferred← citeshttps://doi.org/10.1145/3408996openalex-snapshot

Scala step-by-step: soundness for DOT with step-indexed logical relations in Iris

inferred← citeshttps://doi.org/10.1145/3408998openalex-snapshot

Separation logic for sequential programs (functional pearl)

inferred← citeshttps://doi.org/10.1145/3418295openalex-snapshot

Safe Systems Programming in Rust: The Promise and the Challenge

inferred← citeshttps://doi.org/10.1145/3434287openalex-snapshot

Efficient and provable local capability revocation using uninitialized capabilities

inferred← citeshttps://doi.org/10.1145/3434291openalex-snapshot

Mechanized logical relations for termination-insensitive noninterference

inferred← citeshttps://doi.org/10.1145/3434323openalex-snapshot

Distributed causal memory: modular specification and verification in higher-order distributed separation logic

inferred← citeshttps://doi.org/10.1145/3437992.3439914openalex-snapshot

Machine-checked semantic session typing

inferred← citeshttps://doi.org/10.1145/3437992.3439930openalex-snapshot

Contextual refinement of the Michael-Scott queue (proof pearl)

inferred← citeshttps://doi.org/10.1145/3437992.3439931openalex-snapshot

Reasoning about monotonicity in separation logic

inferred← citeshttps://doi.org/10.1145/3453483.3454031openalex-snapshot

Transfinite Iris: resolving an existential dilemma of step-indexed separation logic

inferred← citeshttps://doi.org/10.1145/3453483.3454036openalex-snapshot

RefinedC: automating the foundational verification of C code with refined ownership types

inferred← citeshttps://doi.org/10.1145/3473597openalex-snapshot

GhostCell: separating permissions from data in Rust

inferred← citeshttps://doi.org/10.1145/3485490openalex-snapshot

Verifying concurrent multicopy search structures

inferred← citeshttps://doi.org/10.1145/3497775.3503689openalex-snapshot

Mechanized verification of a fine-grained concurrent queue from meta’s folly library

inferred← citeshttps://doi.org/10.1145/3497775.3503690openalex-snapshot

Semantic cut elimination for the logic of bunched implications, formalized in Coq

inferred← citeshttps://doi.org/10.1145/3497775.3503951openalex-snapshot

Coq’s vibrant ecosystem for verification engineering (invited talk)

inferred← citeshttps://doi.org/10.1145/3498662openalex-snapshot

Connectivity graphs: a method for proving deadlock freedom based on separation logic

inferred← citeshttps://doi.org/10.1145/3498689openalex-snapshot

Simuliris: a separation logic framework for verifying concurrent program optimizations

inferred← citeshttps://doi.org/10.1145/3519939.3523432openalex-snapshot

Diaframe: automated verification of fine-grained concurrent programs in Iris

inferred← citeshttps://doi.org/10.1145/3527318openalex-snapshot

Le temps des cerises: efficient temporal stack safety on capability machines using directed capabilities

inferred← citeshttps://doi.org/10.1145/3547628openalex-snapshot

Verified symbolic execution with Kripke specification monads (and no meta-programming)

inferred← citeshttps://doi.org/10.1145/3547631openalex-snapshot

Later credits: resourceful reasoning for the later modality

inferred← citeshttps://doi.org/10.1145/3547638openalex-snapshot

Multiparty GV: functional multiparty session types with certified deadlock freedom

inferred← citeshttps://doi.org/10.1145/3571220openalex-snapshot

DimSum: A Decentralized Approach to Multi-language Semantics and Verification

inferred← citeshttps://doi.org/10.1145/3576915.3616602openalex-snapshot

Formalizing, Verifying and Applying ISA Security Guarantees as Universal Contracts

inferred← citeshttps://doi.org/10.1145/3586043openalex-snapshot

Proof Automation for Linearizability in Separation Logic

inferred← citeshttps://doi.org/10.1145/3591275openalex-snapshot

Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic

inferred← citeshttps://doi.org/10.1145/3607856openalex-snapshot

Dependent Session Protocols in Separation Logic from First Principles (Functional Pearl)

inferred← citeshttps://doi.org/10.1145/3632848openalex-snapshot

An Iris Instance for Verifying CompCert C Programs

inferred← citeshttps://doi.org/10.1145/3632853openalex-snapshot

DisLog: A Separation Logic for Disentanglement

inferred← citeshttps://doi.org/10.1145/3632889openalex-snapshot

Deadlock-Free Separation Logic: Linearity Yields Progress for Dependent Higher-Order Message Passing

inferred← citeshttps://doi.org/10.1145/3636501.3636950openalex-snapshot

Unification for Subformula Linking under Quantifiers

inferred← citeshttps://doi.org/10.1145/3656384openalex-snapshot

A Proof Recipe for Linearizability in Relaxed Memory Separation Logic

inferred← citeshttps://doi.org/10.1145/3676954openalex-snapshot

A Logical Approach to Type Soundness

inferred← citeshttps://doi.org/10.1145/3689732openalex-snapshot

Verified Lock-Free Session Channels with Linking

inferred← citeshttps://doi.org/10.1145/3689753openalex-snapshot

Tachis: Higher-Order Separation Logic with Credits for Expected Costs

inferred← citeshttps://doi.org/10.1145/3689762openalex-snapshot

Multris: Functional Verification of Multiparty Message Passing in Separation Logic

inferred← citeshttps://doi.org/10.1145/3689786openalex-snapshot

Type Inference Logics

inferred← citeshttps://doi.org/10.1145/3704841openalex-snapshot

Affect: An Affine Type and Effect System

inferred← citeshttps://doi.org/10.1145/3704847openalex-snapshot

Program Logics à la Carte

inferred← citeshttps://doi.org/10.1145/3704894openalex-snapshot

Bluebell: An Alliance of Relational Lifting and Independence for Probabilistic Reasoning

inferred← citeshttps://doi.org/10.1145/3705593openalex-snapshot

Formal Verification of Just-in-Time Compilation

inferred← citeshttps://doi.org/10.1145/3705593.3705594openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1145/3705593.3705595openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1145/3705593.3705596openalex-snapshot

Background on Just-in-Time Compilation

inferred← citeshttps://doi.org/10.1145/3705593.3705597openalex-snapshot

Background on the CompCert Compiler

inferred← citeshttps://doi.org/10.1145/3705593.3705598openalex-snapshot

Designing Formally Verified JITs

inferred← citeshttps://doi.org/10.1145/3705593.3705599openalex-snapshot

Formally Verified Speculative Optimizations

inferred← citeshttps://doi.org/10.1145/3705593.3705600openalex-snapshot

Formal Verification of Impure Coq JITs

inferred← citeshttps://doi.org/10.1145/3705593.3705601openalex-snapshot

Formal Verification of a JIT Backend Compiler

inferred← citeshttps://doi.org/10.1145/3705593.3705602openalex-snapshot

Assessment

inferred← citeshttps://doi.org/10.1145/3705593.3705603openalex-snapshot

Conclusion

inferred← citeshttps://doi.org/10.1145/3705593.3705604openalex-snapshot

Relating the Developments to the Book

inferred← citeshttps://doi.org/10.1145/3705593.3705605openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1145/3705593.3705606openalex-snapshot

Authors’ Biography/Index

inferred← citeshttps://doi.org/10.1145/3716312openalex-snapshot

Will It Fit? Verifying Heap Space Bounds of Concurrent Programs under Garbage Collection

inferred← citeshttps://doi.org/10.1145/3729284openalex-snapshot

Destabilizing Iris

inferred← citeshttps://doi.org/10.1145/3735592openalex-snapshot

Tree Borrows

inferred← citeshttps://doi.org/10.1145/3756907.3756909openalex-snapshot

Mechanized Type Soundness for Substructural Types using Iris

inferred← citeshttps://doi.org/10.1145/3764860.3768337openalex-snapshot

Modal Verification Patterns for Systems Software

inferred← citeshttps://doi.org/10.1145/3776676openalex-snapshot

A Relational Separation Logic for Effect Handlers

inferred← citeshttps://doi.org/10.1145/3779031.3779095openalex-snapshot

Building Blocks for Step-Indexed Program Logics

inferred← citeshttps://doi.org/10.1145/3798224openalex-snapshot

Mixtris: Mechanised Higher-Order Separation Logic for Mixed Choice Multiparty Message Passing

inferred← citeshttps://doi.org/10.1145/3808303openalex-snapshot

Backwards-Compatible Row-Based Exceptions in ML

inferred← citeshttps://doi.org/10.1145/3808317openalex-snapshot

CRIS: The Power of Imagination in Hybrid Verification

inferred← citeshttps://doi.org/10.1145/3808337openalex-snapshot

A Verified Parallel Scheduler for OCaml 5

inferred← citeshttps://doi.org/10.1145/3828682openalex-snapshot

Completeness of Iris-Based Program Logics

inferred← citeshttps://doi.org/10.1145/3830418.3843873openalex-snapshot

Verifying a high-performance distributed transaction system using permissioned state machines

inferred← citeshttps://doi.org/10.1561/2500000045openalex-snapshot

QED at Large: A Survey of Engineering of Formally Verified Software

inferred← citeshttps://doi.org/10.21203/rs.3.rs-1827512/v1openalex-snapshot

Semantic Cut Elimination for the Logic of Bunched Implications and Structural Extensions, Formalized in Coq

inferred← citeshttps://doi.org/10.4204/eptcs.369.2openalex-snapshot

Mechanizing Matching Logic In Coq

inferred← citeshttps://doi.org/10.46298/lmcs-17(3:9)2021openalex-snapshot

ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity

inferred← citeshttps://doi.org/10.46298/lmcs-18(2:16)2022openalex-snapshot

Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic

inferred← citeshttps://doi.org/10.46298/lmcs-19(4:5)2023openalex-snapshot

Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library

inferred← citeshttps://doi.org/10.48550/arxiv.2010.07080openalex-snapshot

Concise Outlines for a Complex Logic: A Proof Outline Checker for TaDA (Full Paper)

inferred← citeshttps://doi.org/10.70675/bfb1bf73z45cez4651z9900z881984e8c420openalex-snapshot

Formal Verification of Just-in-Time Compilation

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.