A formal system for parallel programs in discrete time and space

DOI10.1016/0020-0190(80)90051-4zbMath0469.68040OpenAlexW2019744737MaRDI QIDQ1157161

Hiroya Kawai

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90051-4

zbMATH Keywords

correctnesscompletenessgeometric model of parallel programsinfinitary temporal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Other infinitary logic (03C75)

Cites Work

• LAR: A logic of algorithmic reasoning
• First-order dynamic logic
• A completeness proof for an infinitary tense-logic
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A formal system for parallel programs in discrete time and space