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

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 373-384

  Moore, J Strother ^a   Zhang, Qiang ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; THEOREM PROVING;

ACL2; NONNEGATIVE EDGE LENGTHS; SHORTEST PATH ALGORITHM;

ALGORITHMS;

EID: 26844557829     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_24     Document Type: Conference Paper

References (12)

1. R. S. Boyer and J S. Moore. Single-threaded objects in ACL2. In PADL 2002, pages 9-27, Heidelberg, 2002. Springer-Verlag LNCS 2257. http://www. es.utexas.edu/users/moore/publications/stobj/main.ps.gz.
2. Jing-Chao Chen. Dijkstra's shortest path algorithm. Journal of Formalized Mathematics, vol. 15, 2003.
3. E. W. Dijkstra. A note on two problems in connection with graphs. Numer. Math. 1, pages 269-271, 1959.
4. Shimon Even. Graph Algorithms, chapter 1. Computer Science Press, Inc., 1979.
5. Eric Fleury. Implantation des algorithmes de Floyd et de Dijkstra dans le Calcul des Constructions. Rapport de Stage, July 1990.
6. M. Gordon, J. Hurd, and K. Slind. Executing the formal semantics of the Accellera property specification language by mechanized theorem proving. In D. Geist, editor, Proceedings of CHARME 2003, volume 2860 of Lecture Notes in Computer Science, pages 200-215. Springer Verlag, 2003.
7. D. Greve and M. Wilding. Using mbe to speed a verified graph pathfinder. In ACL2 Workshop 2003, Boulder, Colorado, July 2003. http://www.cs.utexas.edu/ users/moore/acl2/workshop-2003/.
8. M. Kaufmann, P. Manolios, and J S. Moore. Computer-Aided Reasoning: An Approach. Kluwer Academic Press, Boston, MA., 2000.
9. M. Kaufmann and J S. Moore. Structured theory development for a mechanized logic. Journal of Automated Reasoning, 26(2):161-203, 2001.
10. C. Paulin and J. C. Filliâtre. http://pauillac.inria.fr/cdrom/www/ coq/contribs/floyd.html.
11. R. Sumners. Correctness proof of a BDD manager in the context of satisfiability checking. In Proceedings of ACL2 Workshop 2000. Department of Computer Sciences, Technical Report TR-00-29, November 2000. http://www.ce.utexas.edu/users/moore/acl2/workshop-2000/final/sumners2/paper.ps.
12. R. Sumners and S. Ray. Verification of an in-place quicksort in ACL2. In Proceedings of the ACL2 Workshop, 2002. http://www.cs.utexas.edu/~moore/acl2/ workshop-2002, Grenoble, April 2002.