Proving systolic systems correct

Authors:
Matthew Hennessy
Affiliations:
Univ. of Edinburgh, Edinburgh, Scotland
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Year:
1986

Citing 4
Cited 2

Synchronous and asynchronous experiments on processes

Information and Control
Flowgraphs and Flow Algebras

Journal of the ACM (JACM)
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Introduction to VLSI Systems

Introduction to VLSI Systems

Authors

Communications of the ACM
ACM forum

Communications of the ACM

Quantified Score

Hi-index	0.03

Visualization

Abstract

A language for describing communicating systems is described. It is sufficiently expressive to describe both the desired behavior of systems, their specifications, and their actual implementations in terms of simpler components. We say I satisfies S if 1 is a correct implementation of the specification S. We briefly discuss a semantic treatment of this notion of satisfaction, but the main emphasis of the paper is on a proof technique for proving statements of the form I satisfies S, based on syntactic transformations and induction. Two examples are given, both systolic systems from the literature.