Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Communication and Concurrency
Verifying a Garbage Collection Algorithm
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
On Use Cases and Their Relationships in the Unified Modelling Language
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Towards a verification framework for faulty message passing systems in PVS
Innovations in Systems and Software Engineering
Hi-index | 0.00 |
We introduce a coinductively-defined refinement relation on sequential non-deterministic reactive systems that guarantees total correctness. It allows the more refined system to both have less nondeterminism in its outputs and to accept more inputs than the less refined system. Data reification in VDM is a special case of this refinement. Systems are considered at what we have called fine and medium levels of granularity. At the fine-grain level, a system's internal computational steps are described. The fine-grain level abstracts to a medium-grain level where only input/output and termination behaviour is described. The refinement relation applies to medium grain systems. The main technical result of the paper is the proof that refinement is respected by contexts constructed from fine grain systems. In other words, we show that refinement is a precongruence. The development has been mechanized in PVS to support its use in case studies.