The ASM refinement method

DOI10.1007/s00165-003-0012-7zbMath1093.68601OpenAlexW2074794556MaRDI QIDQ706516

Egon Börger

Publication date: 8 February 2005

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-003-0012-7

zbMATH Keywords

Models of computationSpecifying and Verifying and Reasoning about Programs

Mathematics Subject Classification ID

Related Items (21)

Distributed Adaptive Systems ⋮ Concurrent abstract state machines ⋮ ASM-based formal design of an adaptivity component for a cloud system ⋮ Construction and analysis of ground models and their refinements as a foundation for validating computer-based systems ⋮ The Subject-Oriented Approach to Software Design and the Abstract State Machines Method ⋮ Consistency-preserving refactoring of refinement structures in Event-B models ⋮ Ambient abstract state machines with applications ⋮ Bridging arrays and ADTs in recursive proofs ⋮ Completeness of ASM Refinement ⋮ The computable kernel of abstract state machines ⋮ Completeness of fair ASM refinement ⋮ A high-level modular definition of the semantics of C\(_{\sharp}\) ⋮ ASM refinement and generalizations of forward simulation in data refinement: a comparison ⋮ Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application ⋮ Moded and continuous abstract state machines ⋮ Semantic splitting of conditional belief bases ⋮ Communities and ancestors associated with Egon Börger and ASM ⋮ ASM specification and refinement of a quantum algorithm ⋮ The ASMETA approach to safety assurance of software systems ⋮ Flashix: modular verification of a concurrent and crash-safe flash file system ⋮ Computation on structures. Behavioural theory, logic, complexity

This page was built for publication: The ASM refinement method