Verification of ASM Refinements Using Generalized Forward Simulation
Gerhard Schellhorn
Abstract
Open-access reader
Gerhard Schellhorn
Abstract
Open-access reader
Abstract: This paper describes a generic proof method for the correctness of refine-ments of Abstract State Machines based on commuting diagrams. The method gener-alizes forward simulations from the refinement of I/O automata by allowing arbitrary m:n diagrams, and by combining it with the refinement of data structures.
OpenAlex reports 69 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract: This paper describes a generic proof method for the correctness of refine-ments of Abstract State Machines based on commuting diagrams. The method gener-alizes forward simulations from the refinement of I/O automata by allowing arbitrary m:n diagrams, and by combining it with the refinement of data structures.
Key concepts: Computer science, Correctness, Mathematical proof, Data structure, Theoretical computer science, Automaton, Abstract state machines, Algorithm