Technical Report
Assumption/Commitment Rules for Data-flow Networks --- with an Emphasis on Completeness.
Author(s): Ketil Støen
Year: 1995
Number: TUMI-9516
Editor:
CR Classification:
CR General Terms:
Keywords:
Abstract:During the last 15 years a large number of specification techniques based on the assumption/commitment paradigm have been proposed. The formulation of verification rules for the composition of such specifications is known to be a difficult task. Most rules published so far impose strong constraints on the type of propertie that can be expressed by the assumptions. Moreover, if completeness results are provided at all they are normally quite weak. We investigate these problems in the context of a model for data-flow networks.
Available as compressed Postscript
BibTeX-Entry:
<![CDATA[
@techreport{ TUMI-9516,
author = {Ketil St\oen},
title = {Assumption/Commitment Rules for Data-flow Networks --- with an Emphasis on Completeness.},
number = {TUMI-9516},
institution = {Technische Univerit\"at M\"unchen},
year = {1995},
url = {http://www4.informatik.tu-muenchen.de/reports/TUM-I9516.html},
abstract = {During the last 15 years a large number of specification techniques based on the assumption/commitment paradigm have been proposed. The formulation of verification rules for the composition of such specifications is known to be a difficult task. Most rules published so far impose strong constraints on the type of propertie that can be expressed by the assumptions. Moreover, if completeness results are provided at all they are normally quite weak. We investigate these problems in the context of a model for data-flow networks. },
CRClassification = {},
CRGenTerms = {}
}
]]>