Abstract
We present in this paper an approach for mechanically certifying the correctness of systolic algorithms and detail the correctness proof of a systolic algorithm for a dynamic programming (optimal parenthesization) problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brent, R. P. and Kung, H. T., ‘Systolic VLSI Arrays for Linear-Time GCD Computation’, In VLSI 83, pp. 145–154 (August 1983).
Boyer, R. S. and Moore, J S., A Computational Logic, Academic Press, New York (1979).
Boyer, R. S. and Moore, J S., A Mechanical Proof of the Unsolvability of the Halting Problem’, Journal of the ACM, 31(3), 441–458 (July 1984).
Brookes, S. D., ‘Reasoning about Synchronous VLSI Systems’. Draft, Carnegie-Mellon University (1983).
Chen, M. C., Space-Time Algorithms: Semantics and Methodology. PhD thesis, California Institute of Technology, Pasedena CA (May 1983).
Guibas, L., Kung, H. T. and Thompson, C. D., ‘Direct VLSI Implementation of Combinatorial Algorithms’, In Proc. Conference on Very Large Scale Integration: Architecture, Design and Fabrication, pp. 509–525 (January 1979).
Karp, R., Miller, R. and Winograd, S., ‘The Organization of Computation for Uniform Recurrence Equations’, J. of the ACM 14(3) pp. 563–590 (July 1976).
Kung, H. T. and Leiserson, C., Algorithms for VLSI Processor Arrays, Addison-Wesley, Reading MA, pp. 271–292 (1980).
Knuth, D. E., The Art of Computer Programming, vol 3, Sorting and Searching. Addison-Wesley, Reading MA (1973).
Leiserson, C. E., Area-Efficient VLSI Computation. ACM-MIT Distinguished Dissertation Award series, MIT Press, Cambridge MA (1983).
Melhem, R. G. and Rheinboldt, W. C., ‘A Mathematical Model for the Verification of Systolic Networks’. SIAM Journal of Computing, 13(3), 541–565 (August 1984).
Nelson, G., Techniques for Program Verification. Technical Report CSL-81-10, Xerox (June 1981).
Ossefort, M., ‘Correctness Proof of Communicating Processes: Three illustrative examples from the Literature’. ACM TOPLAS, 5(4), 620–640 (October 1983).
Purushothaman, S., Reasoning about Systolic Algorithms. PhD Thesis, University of Utah (Dec. 1985).
Purushothaman, S., and Subrahmanyam, P. A., ‘Reasoning about Systolic Algorithms’. Journal of Parallel and Distributed Computing, To appear (1987).
Purushothaman, S., ‘A Mechanical Proof of Correctness of a Systolic Architecture for Dynamic Programming’. Tech Report CS-86-011, Pennsylvania State University (1986).
Shapiro, E., Lecture Noles on Bagel: A Systolic Concurrent Programming Machine. Technical Report TM-0031, ICOT (1983).
Sistla, A. P., Theoretical Issues in the Design and Verification of Distributed Systems. PhD thesis, Harvard University (August 1983).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Purushothaman, S., Subrahmanyam, P.A. Mechanical certification of systolic algorithms. J Autom Reasoning 5, 67–91 (1989). https://doi.org/10.1007/BF00245022
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00245022