Program refinement in fair transition systems

DOI10.1007/BF01209623MaRDI QIDQ1323314zbMATH OpenOpenAlexFDO

Authors Ambuj 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

data refinementfair transition systemsprogram refinementsprogram transformations

Mathematics Subject Classification ID

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

Recommendations

• A calculus of refinements for program derivations
• Some proofs of data refinement
• The existence of refinement mappings
• A single complete rule for data refinement

Cites work

• Compiling communicating processes into delay-insensitive VLSI circuits
• Data refinement by calculation
• Derivation of efficient parallel programs: An example from genetic sequence analysis
• Eliminating the substitution axiom from UNITY logic
• scientific article; zbMATH DE number 3936465 (Why is no real title available?)
• scientific article; zbMATH DE number 3705887 (Why is no real title available?)
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• Laws of data refinement
• Proof of correctness of data representations
• Protocol Verification via Projections
• Reduction
• Stepwise refinement of parallel algorithms

Cited in

(11)

• Transformations for communication fairness in CSP
• Adequacy-preserving transformations of COSY path programs
• Automatic discovery of fair paths in infinite-state transition systems
• Finite Abstract Models for Deterministic Transition Systems: Fair Parallel Composition and Refinement-Preserving Logic
• scientific article; zbMATH DE number 3921985 (Why is no real title available?)
• scientific article; zbMATH DE number 4084986 (Why is no real title available?)
• Progress measures and stack assertions for fair termination
• An algebraic approach to refinement with fair choice
• Logic for Programming, Artificial Intelligence, and Reasoning
• Stabilization-preserving atomicity refinement
• The existence of refinement mappings

Describes a project that uses

Uses Software

• UNITY

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

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