Theorem Proving in Higher Order Logics

DOI10.1007/11541868MaRDI QIDQ5477668zbMATHOpenAlexFDO

Authors J Strother Moore, Qiang Zhang

Publication date 6 July 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11541868

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited in

(4)

• Certifying algorithms
• Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
• Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
• ACL2 meets the GPU: formalizing a CUDA-based parallelizable all-pairs shortest path algorithm in ACL2

Describes a project that uses

Uses Software

• ACL2

This page was built for publication: Theorem Proving in Higher Order Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5477668)