pith. sign in

Title resolution pending

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

fields

cs.PL 2 cs.LO 1

years

2026 2 2025 1

roles

background 1

polarities

background 1

representative citing papers

Hyper Separation Logic (extended version)

cs.PL · 2026-04-14 · unverdicted · novelty 8.0

Hyper Separation Logic extends separation logic and Hyper Hoare Logic with a hyper separating conjunction to support arbitrary quantifier alternation for hyperproperties over heap programs, with a soundness proof in Isabelle/HOL.

A Program Logic for Abstract (Hyper)Properties

cs.LO · 2026-01-28 · conditional · novelty 8.0

APPL is a sound, relatively complete abstract program logic that subsumes Hoare, incorrectness, and hyperproperty logics via lattice semantics and a non-idempotent monoidal operator for nondeterminism.

A Complementary Approach to Incorrectness Typing

cs.PL · 2025-10-15 · unverdicted · novelty 7.0

A type system with types over normal forms and a decidable complement operator via subtyping is sound and complete, deriving refutation principles to certify incorrectness in functional programs.

citing papers explorer

Showing 3 of 3 citing papers.

  • Hyper Separation Logic (extended version) cs.PL · 2026-04-14 · unverdicted · partial · ref 33

    Hyper Separation Logic extends separation logic and Hyper Hoare Logic with a hyper separating conjunction to support arbitrary quantifier alternation for hyperproperties over heap programs, with a soundness proof in Isabelle/HOL.

  • A Program Logic for Abstract (Hyper)Properties cs.LO · 2026-01-28 · conditional · none · ref 30

    APPL is a sound, relatively complete abstract program logic that subsumes Hoare, incorrectness, and hyperproperty logics via lattice semantics and a non-idempotent monoidal operator for nondeterminism.

  • A Complementary Approach to Incorrectness Typing cs.PL · 2025-10-15 · unverdicted · none · ref 26

    A type system with types over normal forms and a decidable complement operator via subtyping is sound and complete, deriving refutation principles to certify incorrectness in functional programs.