Paper Info
Title
Abstract pecification of Synchronous Data Types for VLSI and Proving the Correctness of Systolic Network Implementations
Abstract
A combined methodology is presented for specifying abstract synchronous data types and proving the correctness of systolic network implementations. It is shown that an extension of the Parnas trace method of specifying software modules containing distinct access programs yields a natural method of specifying abstract synchronous data types that possess distinct access operators and are intended for implementation in VLSI. Associated systematic proof techniques are presented, and the correctness of several novel systolic network implementations of familiar data types is established. The methodology appears to be naturally suited to systolic network implementations with their associated rippling of control flow and data flow. The important distinction between systolic control-flow networks and systolic data-flow networks is presented.
Year
DOI
Venue
1988
10.1109/12.2209
IEEE Transactions on Computers
Keywords
Field
DocType
network implementation,Synchronous Data Types,abstract synchronous data type,novel systolic network implementation,systolic data-flow network,data flow,systolic control-flow network,combined methodology,abstract pecification,systolic network implementation,Systolic Network Implementations,Parnas trace method,familiar data type
Data structure,Synchronization,Programming language,Computer science,Parallel computing,Control flow,Correctness,Theoretical computer science,Rippling,Data type,Very-large-scale integration,Data flow diagram
Journal
Volume
Issue
ISSN
37
6
0018-9340
Citations 
PageRank 
References 
1
0.40
7
Authors
2
Name
Order
Citations
PageRank
David K. Probst110329.79
Hon F. Li218051.45