Imagen de Portada

Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Praveen, M., Ramesh, Raghavendra, Doidge, Isaac
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science C.2.2; F.4.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Constant time testability of first-order logic with modulo counting on finitary graphs
por: Adler, Isolde, et al.
Publicado: (2026)

Introducing The Maximum Common Bigraph Problem
por: Burns, Kyle, et al.
Publicado: (2026)

When do homomorphism counts help in query algorithms?
por: Cate, Balder ten, et al.
Publicado: (2023)

On the Satisfaction Probabilities of $k$-CNF Formulas
por: Tantau, Till
Publicado: (2022)

The Fluted Fragment with Transitive Relations
por: Pratt-Hartmann, Ian, et al.
Publicado: (2020)

Deducibility in the full Lambek calculus with weakening is HAck-complete
por: Greati, Vitor, et al.
Publicado: (2024)

Hypersequent Calculi Have Ackermannian Complexity
por: Balasubramanian, A. R., et al.
Publicado: (2026)

Homomorphism Indistinguishability and Game Comonads for Restricted Conjunction and Requantification
por: Schindling, Georg
Publicado: (2025)

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
por: Kazakov, Yevgeny, et al.
Publicado: (2009)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
por: de Rezende, Susanna F., et al.
Publicado: (2019)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
por: Anttila, Aleksi, et al.
Publicado: (2025)

From Zonotopes to Proof Certificates: A Formal Pipeline for Safe Control Envelopes
por: Hellwig, Jonathan, et al.
Publicado: (2025)

Degree-preserving Godel logics with an involution: intermediate logics and (ideal) paraconsistency
por: Coniglio, M. E., et al.
Publicado: (2026)

Three Fixed-Dimension Satisfiability Semantics for Quantum Logic: Implications and an Explicit Separator
por: Higuchi, Joaquim Reizi
Publicado: (2026)

Unravelling Abstract Cyclic Proofs into Proofs by Induction
por: Grotenhuis, Lide, et al.
Publicado: (2026)

Semantics out of context: nominal absolute denotations for first-order logic and computation
por: Gabbay, Murdoch J.
Publicado: (2013)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
por: Grabmayer, Clemens
Publicado: (2024)

Locality in Residuated-Lattice Structures
por: Carr, James
Publicado: (2025)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
por: Sau, Ignasi, et al.
Publicado: (2026)

A Resolution-Based Interactive Proof System for UNSAT
por: Czerner, Philipp, et al.
Publicado: (2024)

On the Formalization of Network Topology Matrices in HOL
por: Aksoy, Kubra, et al.
Publicado: (2026)

A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report
por: Klaus, Natalia, et al.
Publicado: (2026)

Formal Verification of Diffusion Auctions
por: Galimullin, Rustam, et al.
Publicado: (2025)

A Coq-based Axiomatization of Tarski's Mereogeometry
por: Barlatier, Patrick, et al.
Publicado: (2025)

Finite Hilbert systems for Weak Kleene logics
por: Greati, Vitor, et al.
Publicado: (2024)

Axiomatizing the Logic of Ordinary Discourse
por: Greati, Vitor, et al.
Publicado: (2024)

A Complete Finitary Refinement Type System for Scott-Open Properties
por: Riba, Colin, et al.
Publicado: (2026)

One Energy Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics
por: Bisping, Benjamin, et al.
Publicado: (2024)

Interpreting De Finetti's theorem in the Category of Integrable Cones (long version)
por: Raphaëlle, Crubillé
Publicado: (2026)

A Fibrational Perspective on Differential Linear Logic
por: Koleilat, Jad
Publicado: (2026)

On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
por: Lago, Ugo Dal, et al.
Publicado: (2026)

Relational Dualities and Bisimulation
por: Kozicki, Piotr, et al.
Publicado: (2026)

Modal Logics -- RNmatrices vs. Nmatrices
por: Coniglio, Marcelo E., et al.
Publicado: (2024)

Robust Computation Tree Logic
por: Nayak, Satya Prakash, et al.
Publicado: (2022)

On Angels and Demons: Strategic (De)Construction of Dynamic Models
por: Catta, Davide, et al.
Publicado: (2026)

Notes on CSPs and Polymorphisms
por: Brady, Zarathustra
Publicado: (2022)

OnlineProver: Experience with a Visualisation Tool for Teaching Formal Proofs
por: Perháč, Ján, et al.
Publicado: (2025)

FastLEC: Parallel Datapath Equivalence Checking with Hybrid Engines
por: Zhang, Xindi, et al.
Publicado: (2025)

Converting BPMN Diagrams to Privacy Calculus
por: Pitsiladis, Georgios V., et al.
Publicado: (2024)

Deontic Temporal Logic for Formal Verification of AI Ethics
por: V., Priya T., et al.
Publicado: (2025)