An algebraic definition of simulation between programs
An algebraic definition of simulation between programs
On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Efficient reducibility between programming systems (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
ACM '72 Proceedings of the ACM annual conference - Volume 2
ACM SIGPLAN Notices - Special issue on control structures in programming languages
Classics in software engineering
Some Problems in Certifying Microprograms
IEEE Transactions on Computers
On homomorphisms, correctness, termination, unfoldments, equivalence of flow diagram programs
Journal of Computer and System Sciences
Correct transformation: From object-based graph grammars to PROMELA
Science of Computer Programming
Survey: A survey of state vectors
Computer Science Review
Hi-index | 0.00 |
A program in flow diagram form is described by a function from a free category to the category of sets and relations. Attaching assertions to it is described as a natural transformation and so is simulation of one program by another with the same shape of flow diagram. These notions are used to prove the theorems justifying Floyd's method of proving correctness by verification and Milner's method of proving simulation, restricted to programs of similar form. The treatment is novel but the results are not new, except that non-deterministic programs are dealt with throughout.