Proof pearl: Dijkstra's shortest path algorithm verified with ACL2

Authors:
J. Strother Moore;Qiang Zhang
Affiliations:
Department of Computer Sciences, University of Texas at Austin, Austin, Texas;Department of Computer Sciences, University of Texas at Austin, Austin, Texas
Venue:
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Year:
2005

Citing 4
Cited 4

Graph Algorithms

Graph Algorithms
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
Structured Theory Development for a Mechanized Logic

Journal of Automated Reasoning
Single-Threaded Objects in ACL2

PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages

A case study of C source code verification: the Schorr-Waite algorithm

SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Proof of transitive closure property of directed acyclic graphs

Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Formal verification of coalescing graph-coloring register allocation

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We briefly describe a mechanically checked proof of Dijkstra's shortest path algorithm for finite directed graphs with nonnegative edge lengths. The algorithm and proof are formalized in ACL2.