Completeness of fair ASM refinement-Reference-Cited by-同舟云学术

Completeness of fair ASM refinement

Published:2011-09 Issue:9 Volume:76 Page:756-773
ISSN:0167-6423
Container-title:Science of Computer Programming
language:en
Short-container-title:Science of Computer Programming

Author:

Schellhorn Gerhard

Publisher

Elsevier BV

Subject

Software

Reference44 articles.

1. Refinement, decomposition, and instantiation of discrete models: Application to event-B;Abrial;Fundamenta Informaticae,2006

2. The existence of refinement mappings;Abadi;Theoretical Computer Science,1991

3. M. Balser, Verifying Concurrent System with Symbolic Execution–Temporal Reasoning is Symbolic Execution with a Little Induction, Ph.D. Thesis, University of Augsburg, Augsburg, Germany, 2005

4. Michael Balser, Simon Bäumler, Wolfgang Reif, Gerhard Schellhorn, Interactive verification of concurrent systems using symbolic execution, in: Proceedings of 7th International Workshop of Implementation of Logics, IWIL 08, 2008

5. On the refinement and simulation of data types and processes;Bolton,1999

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ASM Specification and Refinement of a Quantum Algorithm;Logic, Computation and Rigorous Methods;2021

2. Stepwise abstraction of high-level system specifications from source code;Journal of Computer Languages;2020-10

3. Why Programming Must Be Supported by Modeling and How;Leveraging Applications of Formal Methods, Verification and Validation. Modeling;2018

4. Modular, crash-safe refinement for ASMs with submachines;Science of Computer Programming;2016-12

5. Inside a Verified Flash File System: Transactions and Garbage Collection;Lecture Notes in Computer Science;2016