![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
Appeared in Volume 6/2, May 1993
CASLOG (Complexity Analysis System for LOGic) is an experimental semi-automatic complexity analysis system for logic programs. It can perform worst-case analysis for complexity measures: argument size complexity, number of solutions complexity, and time complexity.
CASLOG extends the techniques developed for analyzing imperative and functional languages to deal with nondeterminism and the generation of multiple solutions via backtracking.
The system can also handle predicates involving linear arithmetic constraints and binary disequality constraints, given the right domain information.
This is an alpha release, containing CASLOG version 1.0, a preliminary user
manual, a paper on CASLOG, and several examples. The system is available by
anonymous FTP from:
ftp://cs.arizona.edu/caslog
For more information contact:
Nai-Wei Lin Dept. of Computer Science Univ. of Arizona Tucson, Arizona 85721, USA Email: naiwei@cs.arizona.edu
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |