A proof of the determinacy property of the data flow schema

DOI10.1016/0020-0190(84)90121-2MaRDI QIDQ796973zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

abstract semanticsdata flow determinacydeterminacy of data flow schema

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3469994 (Why is no real title available?)
• A proof of the determinacy property of the data flow schema
• Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing

Cited in

(3)

• A tree-based approach to data flow proofs
• 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)