A proof of the determinacy property of the data flow schema

DOI10.1016/0020-0190(84)90121-2zbMATH Open0544.68008OpenAlexW2010869437MaRDI QIDQ796973FDOQ796973

Ashok K. Agrawala, Carl H. Smith, Nam Sung Woo

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90121-2

Recommendations

• A tree-based approach to data flow proofs
• A simplified proof of \(DDL<DL\)
• Some proofs of data refinement
• Publication:4727404
• scientific article; zbMATH DE number 3924115

zbMATH Keywords

abstract semanticsdata flow determinacydeterminacy of data flow schema

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
• A proof of the determinacy property of the data flow schema

Cited In (2)

• Properties of data flow frameworks: A unified model
• A proof of the determinacy property of the data flow schema

This page was built for publication: A proof of the determinacy property of the data flow schema

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796973)