File: README

package info (click to toggle)
acl2 8.0dfsg-1
  • links: PTS
  • area: main
  • in suites: buster
  • size: 226,956 kB
  • sloc: lisp: 2,678,900; ansic: 6,101; perl: 5,816; xml: 3,586; cpp: 2,624; ruby: 2,576; makefile: 2,443; sh: 2,312; python: 778; yacc: 764; ml: 763; awk: 260; csh: 186; php: 171; lex: 165; tcl: 44; java: 41; asm: 23; haskell: 17
file content (21 lines) | stat: -rw-r--r-- 760 bytes parent folder | download | duplicates (11) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 
These files contain an optimized version of a program that searches
for a path in a graph.  It is the subject of 2 ACL2 workshop papers,
one in 2000 by Matt Wilding and one in 2003 by David Greve and Matt
Wilding, that describe using ACL2 features to build fast and
verifiable software.

A makefile creates books from two files

  fpst.lisp - definition of the optimized pathfinder and proof that 
  it is equivalent to previously distributed version

  run-fpst.lisp - definitions that provide for benchmarking the
  pathfinder

This proof relies upon books developed by J Moore that are freely
available and documented in the chapter "An Exercise in Graph Theory"
in the book "Computer-Aided Reasoning: ACL2 Case Studies".

David Greve
Matt Wilding
June 2003