Program refinement in fair transition systems

DOI10.1007/BF01209623zbMath0790.68078OpenAlexW2082020846MaRDI QIDQ1323314

Ambuj K. Singh

Publication date: 10 May 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01209623

zbMATH Keywords

program transformationsdata refinementprogram refinementsfair transition systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General topics in the theory of software (68N01)

Related Items (1)

An Algebraic Approach to Refinement with Fair Choice

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eliminating the substitution axiom from UNITY logic
• Data refinement by calculation
• Derivation of efficient parallel programs: An example from genetic sequence analysis
• Stepwise refinement of parallel algorithms
• Compiling communicating processes into delay-insensitive VLSI circuits
• Laws of data refinement
• Proof of correctness of data representations
• Protocol Verification via Projections
• Reduction

This page was built for publication: Program refinement in fair transition systems