Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
The Z notation: a reference manual
The Z notation: a reference manual
ACM Transactions on Programming Languages and Systems (TOPLAS)
A behavioral notion of subtyping
ACM Transactions on Programming Languages and Systems (TOPLAS)
Forward and backward simulations I.: untimed systems
Information and Computation
Evolving algebras 1993: Lipari guide
Specification and validation methods
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Verifying Temporal Properties of Reactive Systems: A STeP Tutorial
Formal Methods in System Design
Refinement in Z and object-Z: foundations and advanced applications
Refinement in Z and object-Z: foundations and advanced applications
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
ESOP '86 Proceedings of the European Symposium on Programming
MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control
CSL '89 Proceedings of the 3rd Workshop on Computer Science Logic
On the Refinement and Simulation of Data Types and Processes
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Using coupled simulations in non-atomic refinement
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
On the Refinement of Atomic Actions
Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Retrenching the Purse: The Balance Enquiry Quandary, and Generalised and (1,1) Forward Refinements
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Completeness of ASM Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Linking the Meaning of Programs to What the Compiler Can Verify
Verified Software: Theories, Tools, Experiments
Verification of Mondex Electronic Purses with KIV: From a Security Protocol to Verified Code
FM '08 Proceedings of the 15th international symposium on Formal Methods
Refinement of State-Based Systems: ASMs and Big Commuting Diagrams (Abstract)
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
A Concept-Driven Construction of the Mondex Protocol Using Three Refinements
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Verifying smart card applications: an ASM approach
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
A deidealisation semantics for KAOS
Proceedings of the 2010 ACM Symposium on Applied Computing
Completeness of fair ASM refinement
Science of Computer Programming
Developing provable secure m-commerce applications
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
A compositional framework for service interaction patterns and interaction flows
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Tutorial: the ASM method for system design and analysis. a tutorial introduction
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
The mondex challenge: machine checked proofs for an electronic purse
FM'06 Proceedings of the 14th international conference on Formal Methods
Using abstract state machines for the design of multi-level transaction schedulers
Rigorous Methods for Software Construction and Analysis
A systematic verification approach for mondex electronic purses using ASMs
Rigorous Methods for Software Construction and Analysis
The subject-oriented approach to software design and the abstract state machines method
Conceptual Modelling and Its Theoretical Foundations
Continuous ASM, and a pacemaker sensing fragment
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Retrenching the Purse: The Balance Enquiry Quandary, and Generalised and (1,1) Forward Refinements
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Editorial: Data migration: A theoretical perspective
Data & Knowledge Engineering
| Hi-index | 0.00 |
In (J. Universal Comput. Sci. 7 (2001) 952), we have formalized Börger's refinement notion for Abstract State Machines (ASMs). The formalization was based on transition systems and verification conditions were expressed in Dynamic Logic.In this paper, the relation between ASM refinement and data refinement is explored. Data refinement expresses operations and verification conditions using relational calculus.We show how to bridge the gap between the different notations, and that forward simulation in the behavioral approach to data refinement can be viewed as a specific instance of ASM refinement with 1:1 diagrams, where control structure is not refined.We also prove that two recent generalizations of data refinement, weak refinement and coupled refinement can be derived from ASM refinement.