Proc. of the European symposium on programming on ESOP 86
The existence of refinement mappings
Theoretical Computer Science
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
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
On the Refinement and Simulation of Data Types and Processes
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Verified formal security models for multiapplicative smart cards
Journal of Computer Security - Special issue on ESORICS 2000
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
ASM Refinement and generalizations of forward simulation in data refinement: a comparison
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
Universal extensions to simulate specifications
Information and Computation
Verification of Mondex electronic purses with KIV: from transactions to a security protocol
Formal Aspects of Computing
Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Completeness of ASM Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Mechanizing a Correctness Proof for a Lock-Free Concurrent Stack
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
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
Relational concurrent refinement part II: Internal operations and outputs
Formal Aspects of Computing
Using coupled simulations in non-atomic refinement
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
A systematic verification approach for mondex electronic purses using ASMs
Rigorous Methods for Software Construction and Analysis
| Hi-index | 0.00 |
Effective and efficient support for the incremental development of verified implementations from abstract requirements has always been of central importance for the successful application of formal methods in practice.Effective means first, that a modelling language is available that allows an adequate problem specification. Second, a refinement theory must be available that preserves the relevant properties of the abstract specification.Efficient means, that the refinement theory reduces the problem to the essential proof obligations necessary, and that the theorem prover provides powerful deduction support.The talk discusses the topic from the experience we have gained from formalizing various refinement theories [1], [2] with the interactive theorem prover KIV [3], as well as from the correctness proofs for various case studies involving refinement.