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.
super hub Canonical reference
Scalable Funding of Bitcoin Micropayment Channel Networks
Canonical reference. 82% of citing Pith papers cite this work as background.
192
Pith papers citing it
Background
82% of classified citations
hub tools
citation-role summary
background 38
method 3
other 2
baseline 1
dataset 1
citation-polarity summary
authors
co-cited works
representative citing papers
2G2T enables constant-size, statistically sound outsourcing of MSM with verification up to 300x faster than local computation and error probability at most 1/q.
A survey of 172 open educational datasets from 204 papers across LAK, EDM, and AIED conferences reveals trends, 143 previously uncatalogued datasets, field gaps, and an 8-item PRACTICE checklist for better data publication.
A dependent linear type theory is constructed by embedding linear logic into dependent type theory, yielding multiplicities that depend on variables, supporting W-types, with semantics in indexed Categories with Families and an Agda implementation.
HDL defines dynamic theories with lifting and combination operations, proves soundness and relative completeness in Isabelle, and demonstrates the approach on a Java controller steering a differential dynamic logic plant model.
SPoILeR uses multimodal pre-training to enable accurate novel view synthesis of infrared, polarimetric, and multispectral data from RGB-supervised fine-tuning on new scenes.
A differentiable neural framework for learning state- and time-dependent parameters of finite-state mean field games from population trajectories via implicit differentiation.
MeiBRD meta-learns a graph-neural residual deformation function to correct linear biomechanical predictions for intraoperative liver registration from sparse context samples.
SpikeTAD proposes the first SNN-based end-to-end TAD model, reporting 67.2% mAP on THUMOS14 and 37.42% on ActivityNet-1.3 with extremely low power consumption.
For lopsided trees with t2 >= 2 t1, Burr's bound has a gap of order max(t1^2/t2, sqrt(t1)); for t2 >= 500 t1 the bound is tight if Delta(T) <= t2 - t1 but off by Omega(log t2) otherwise.
Recurrence of x-periodic rogue waves in Q1D MNLS shows model-dependent fission/fusion and is described analytically by finite gap perturbation theory of NLS AWs with good numerical agreement.
The paper proposes the ontological continuum as a new theoretical construct defined by two orthogonal distinctions to provide a vocabulary for describing, comparing, navigating, and transforming knowledge graphs across modeling practices.
An O(n^5) exact algorithm for broadcast domination obtained by reducing the path-case to O(n^3) via a single DAG on oriented broadcast balls.
Polyconvexity implies true-stress-true-strain monotonicity in incompressible isotropic hyperelasticity, which is enforced in four PANN architectures that show varying extrapolation behavior on experimental data.
Event-B Agent is an LLM agent that synthesizes, refines, and repairs Event-B formal models from natural language requirements via iterative verification feedback loops.
CDCL SAT solvers compute small proofdoors on linearly scaling BMC families but large non-absorbed ones on exponential families, as shown by empirical measurements on a 76k+ instance benchmark where prior parameters fail to discriminate regimes.
Proves that ℓ_p norm minimization yields p-independent Hausdorff convergence rate O(k^{2/(1-q)}) in convex vector optimization via Euclidean intermediary and norm equivalence.
A compositional algebraic decision diagram algorithm quantifies sensitivity in decision tree ensembles with certified error and confidence bounds, outperforming model counters on benchmarks.
PAFP is FPT by BFS-width plus backward arcs in the union digraph and polynomial-time solvable via 2-SAT for DAGs of exact-length width 2, with matching NP-hardness for width 3.
FLiD is a field-localized forgery detection method for identity documents that outperforms full-document baselines and general detectors with significantly fewer parameters.
LLM2Ltac mines symbolic tactics from 11,725 Coq theorems using LLMs and integrates them into CoqHammer, improving proof rates by 23.87% on 6,199 theorems from four large verification projects.
A source-level interaction concept for interactive program verification, prototyped in KeY, improves user understanding of proof states and defect detection according to a user study.
SCHORTY uses a tilted sensor in a single camera to map pixel position to range via the Scheimpflug principle, demonstrated experimentally with event cameras for passive UAV ranging up to 1.1 km.
Text-guided class-agnostic counting models exhibit significant weaknesses in grounding textual prompts to visual objects, as demonstrated by new negative-label and distractor tests on a multi-category dataset.
citing papers explorer
-
Hyper Separation Logic (extended version)
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.
-
Dependent Multiplicities in Dependent Linear Type Theory
A dependent linear type theory is constructed by embedding linear logic into dependent type theory, yielding multiplicities that depend on variables, supporting W-types, with semantics in indexed Categories with Families and an Agda implementation.
-
A New Interaction Concept for Interactive and Autoactive Program Verification
A source-level interaction concept for interactive program verification, prototyped in KeY, improves user understanding of proof states and defect detection according to a user study.
-
Hybrid Path-Sums for Hybrid Quantum Programs
Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.
-
A Categorical Basis for Robust Program Analysis
A categorical framework characterizes robustness in program analysis as functors and gives recipes for lifting sound robust analyses from restricted models to general programs.
-
Typing Fallback Functions: A Semantic Approach to Type Safe Smart Contracts
Semantic typing via coinductively defined interpretations on a typed operational semantics ensures information flow control and non-interference for TinySol contracts that use fallback functions.
-
Omnidirectional type inference for ML: principality any way
Omnidirectional type inference restores principality for ML extensions with fragile constructs via dynamic constraint solving with suspended matches and incremental instantiation of generalized types.
-
Concolic Testing Heap-Manipulating Programs
CSF is the first separation logic-based concolic testing engine for heap-manipulating programs that integrates specification-based testing to generate valid inputs with high coverage.
-
Understanding GCC Builtins to Develop Better Tools
Analysis of 4,913 C projects found 37% use at least one GCC builtin, 10 builtins cover over 30% of projects, 110 cover 90%, builtins are still being added, and many tools have incomplete or incorrect support.
-
Big-step and small-step Horn clause derivations applied to operational semantics
Proves equivalence of big-step and small-step Horn clause derivations and supplies a transformation to convert any clause set into one inheriting a chosen derivation behavior.
-
Trustworthy Runtime Verification via Bisimulation (Extended Experience Report)
CopilotVerifier generates bisimulation proofs via Crucible symbolic execution and What4 SMT to establish output equivalence and identical crash behavior between Copilot monitors and their compiled forms.