File: README

package info (click to toggle)
acl2 7.2dfsg-3
  • links: PTS
  • area: main
  • in suites: stretch
  • size: 198,968 kB
  • ctags: 182,300
  • sloc: lisp: 2,415,261; ansic: 5,675; perl: 5,577; xml: 3,576; sh: 3,255; cpp: 2,835; makefile: 2,440; ruby: 2,402; python: 778; ml: 763; yacc: 709; csh: 355; php: 171; lex: 162; tcl: 44; java: 24; 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