Formalizing Categorical Structures in Coq for Automated Reasoning and Visualization
ViCAR provides a framework for defining and working with monoidal categories in Coq, enabling automated rewriting and visualization of categorical structures.
Mechanised Hypersafety Proofs for Efficient Computations on Structured Data
Structured data representations, such as sparse and compressed tensors, can be efficiently manipulated by exploiting their structural properties. The authors develop a relational logic, LGTM, that enables mechanised proofs of hypersafety properties for such computations.
Efficient Formal Verification of Linear Temporal Logic Specifications Using Hybrid Zonotope-Based Reachability Analysis
This work introduces a hybrid zonotope-based approach for efficiently verifying the behavior of autonomous systems operating under Linear Temporal Logic (LTL) specifications by constructing temporal logic trees (TLTs) via backward reachability analysis.
Completeness of Relational Hoare Logics for Universal and Existential Properties
This paper proves alignment completeness of relational Hoare logics for both universal (∀∀) and existential (∀∃) relational properties. It also introduces sound rules that enable reasoning about relational properties beyond the scope of prior relational Hoare logics.
© 2024 by Linnk AI