Completeness of fair ASM refinement (Q541210)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Completeness of fair ASM refinement	scientific article

Statements

scholarly article

Completeness of fair ASM refinement (English)

Gerhard Schellhorn

Science of Computer Programming

publication date

6 June 2011

zbMATH Keywords

refinement

completeness

abstract state machines

IO automata

Abadi-Lamport

fairness

describes a project that uses

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.scico.2009.10.004

The existence of refinement mappings

Interactive verification of concurrent systems using symbolic execution

The ASM refinement method

Abstract State Machines

Data Refinement

Evolving Algebras 1993: Lipari Guide

A theory of normed simulations

Programs, Recursion and Unbounded Choice

Eternity variables to prove simulation of specifications

Splitting forward simulations to cope with liveness

Universal extensions to simulate specifications

Forward and backward simulations. I. Untimed Systems

Relation-algebraic semantics

ASM refinement and generalizations of forward simulation in data refinement: a comparison

Proving correctness with respect to nondeterministic safety specifications

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.SCICO.2009.10.004

Sitelinks

Mathematics(1 entry)

mardi Publication:541210

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q541210&oldid=38395411"