Image de couverture de livre

The Secrets Must Not Flow: Scaling Security Verification to Large Codebases (artifact)

Fuente: Zenodo

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Arquint, Linard, Kishor, Samarth, Koenig, Jason, Dodds, Joey, Kroening, Daniel, Müller, Peter
Format:	Recurso digital
Langue:	anglais
Publié:	Zenodo 2025
Sujets:	protocol implementation verification symbolic security separation logic automated verification static analysis injective agreement
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Computer Aided Verification of Relational Models by Strategic Rewriting
par: Claudia M. Necco
Publié: (2017)

Divided Focus: Separated Memory Spaces and Default-Deny Context Triage for LLM Context Management
par: Phan, Ivan "HiP"
Publié: (2026)

Divided Focus: Separated Memory Spaces and Default-Deny Context Triage for LLM Context Management
par: Phan, Ivan "HiP"
Publié: (2026)

Catelingo: Constraint-Based Semantic Validity Verification for Language Models
par: Miya, Shinobu
Publié: (2026)

Claim Verification: "The Pyramid of Giza was built by slaves." — Disproved
par: Proof Engine
Publié: (2026)

Claim Verification: "AI hallucinations occur on fewer than 5% of factual questions" — Disproved
par: Proof Engine
Publié: (2026)

Proof Engine Verification (PROVED): Training and running today's frontier AI models consumes more electricity than entire small countries.
par: Proof Engine
Publié: (2026)

Claim Verification: "GLP-1 drugs like Ozempic cause unavoidable major muscle loss and "Ozempic face" even with exercise and high protein intake" — Disproved
par: Proof Engine
Publié: (2026)

Claim Verification: "Quantum entanglement enables the transmission of usable information faster than the speed of light when the distant parties pre-agree on a measurement basis." — Disproved
par: Proof Engine
Publié: (2026)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\) (where exp is the exponential function and ln is the principal branch of the natural logarithm). For every real \(x > 0\), the nested expression \(\text{eml}(1, \text{eml}(\text{eml}(1, x), 1))\) equals the natural logarithm \(\ln(x)\)." — Proved
par: Proof Engine
Publié: (2026)

Claim Verification: "The binary operator eml is defined by the expression \(\text{eml}(a, b) = \exp(a) - \ln(b)\). There exists a finite binary tree consisting solely of eml operations, whose 9 leaves are drawn from \(\{1, x, y\}\), such that the tree evaluates exactly to \(x \times y\). The tree has K = 17 tokens (8 eml operations and 9 leaves), and the identity holds for all complex \(x\) and \(y\) (in the algebraic setting where \(\ln \circ \exp\) is the identity)." — Proved
par: Proof Engine
Publié: (2026)

Computer Aided Verification
Publié: (2023)

Frontiers of Combining Systems
Publié: (2023)

Selfie Verification: A Comprehensive Guide to Secure Identity Authentication in the Digital Age
par: Crypto Education Research Lab
Publié: (2025)

Computer Aided Verification
Publié: (2023)

Analysis of the Properties of the Bluetooth Baseband Connection Establishment Using Colored Petri Nets
par: María Elena Villapol
Publié: (2012)

The Substrate Separation Principle: Why More Reasoning Cannot Fix Biased Reasoning
par: Tanaka, Yuichiro
Publié: (2026)

Automated Deduction – CADE 29
Publié: (2023)

A Bottom-Up Closure Framework for Multi-Solution and Multi-Dimensional Structures
par: Heo, Bangwon
Publié: (2026)

Speaker Verification in Different Database Scenarios
par: Leibny Paola García Perera
Publié: (2011)

Programming Languages and Systems: 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings
par: Ahmed, Amal
Publié: (2018)

Principles of Security and Trust: 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings
Publié: (2018)

The δ-Gene: Inference-Time Physical Unclonable Functions from Architecture-Invariant Output Geometry
par: Coslett, Anthony
Publié: (2026)

The Secrets Must Not Flow: Scaling Security Verification to Large Codebases (extended version)
par: Arquint, Linard, et autres
Publié: (2025)

AgentBelt: Runtime Guardrails for LLM Agent Tool Calls — ASE 2026 Artifact
par: Anonymous
Publié: (2026)

Tools and Algorithms for the Construction and Analysis of Systems: 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part I
Publié: (2018)

Universal Bridge Theorem: A Cohomological Framework for Construction-Independent Invariants
par: Maréchal, Thierry
Publié: (2026)

Lean Aps Recursion Uniformization (Lean formalization)
par: Spivack, Nova
Publié: (2026)

Lean Observer Non Exhaustability (Lean formalization)
par: Spivack, Nova
Publié: (2026)

Lean Observer Non Exhaustability (Lean formalization)
par: Spivack, Nova
Publié: (2026)

Lean Representational Incompleteness (Lean formalization)
par: Spivack, Nova
Publié: (2026)

Lean Representational Incompleteness (Lean formalization)
par: Spivack, Nova
Publié: (2026)

Lean Reflexive Closure (Lean formalization)
par: Spivack, Nova
Publié: (2026)

Lean Reflexive Architecture Nonexhaustibility (Lean formalization)
par: Spivack, Nova
Publié: (2026)

UGP/GTE Lean formalization
par: Spivack, Nova
Publié: (2026)

Foundations of Software Science and Computation Structures: 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings
Publié: (2018)

Towards a Universal Digital Identity- A Blockchain-Based Framework for Borderless Verification
par: Akhison, Glad
Publié: (2025)

A Timestamped Priority Note on Thermodynamic Verification Budgets and Mutual-Information Geometry in Relational Physics
par: Panasenko, Alexander
Publié: (2026)

The Agda standard library: version 2.0
par: Daggitt, Matthew, et autres
Publié: (2025)

Lean Nems (Lean formalization)
par: Spivack, Nova
Publié: (2026)