The existence of refinement mappings
Theoretical Computer Science
A superimposition control construct for distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Software engineering with B
Comparing LOTOS and Z refinement relations
IFIP TC6/ 6.1 international conference on formal description techniques IX/protocol specification, testing and verification XVI on Formal description techniques IX : theory, application and tools: theory, application and tools
Specification in B: An Introduction Using the B Toolkit
Specification in B: An Introduction Using the B Toolkit
Program Development by Refinement: Case Studies Using the B Method
Program Development by Refinement: Case Studies Using the B Method
Superimposition for Interacting Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Trace Refinement of Action Systems
CONCUR '94 Proceedings of the Concurrency Theory
More Powerful Z Data Refinement: Pushing the State of the Art in Industrial Refinement
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
Retrenchment: An Engineering Variation on Refinement
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Class Refinement and Interface Refinement in Object-Oriented Programs
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Retrenchment and Punctured Simulation
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
On the Refinement and Simulation of Data Types and Processes
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Refinement Calculus, Part II: Parallel and Reactive Programs
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
On Decomposing and Refining Specifications of Distributed Systems
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Completeness Theorems for Automata
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Multivalued Possibilities Mappings
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Decentralization of process nets with centralized control
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
From z to c: illustration of a rigorous development method (specification hierarchy)
From z to c: illustration of a rigorous development method (specification hierarchy)
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
Soft-Ware 2002 Proceedings of the First International Conference on Computing in an Imperfect World
Controlling Control Systems: An Application of Evolving Retrenchment
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Minimally and Maximally Abstract Retrenchments
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
On the Formal Development of Safety-Critical Software
Verified Software: Theories, Tools, Experiments
Three perspectives in formal engineering
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Formal program development with approximations
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
| Hi-index | 0.00 |
Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models to more complex and realistic ones. In retrenchment the relationship between an abstract operation and its concrete counterpart is mediated by extra predicates, allowing the expression of non-refinement-like properties and the mixing of I/O and state aspects in the passage between levels of abstraction. Modulated refinement is introduced as a version of refinement allowing mixing of I/O and state aspects, in order to facilitate comparison between retrenchment and refinement, and various notions of simulation are considered in this context. Stepwise simulation, the ability of the simulator to mimic a sequence of execution steps of the simulatee in a sequence of equal length is proposed as the benchmark semantic notion for relating concepts in this area. One version of modulated refinement is shown to have particularly strong connections with automata theoretic strong simulation, in which states and step labels are mapped independently from simulator to simulatee. A special case of retrenchment, simple simulable retrenchment is introduced, and shown to have properties very close to those of modulated refinement. The more general situation is discussed briefly. The details of the theory are worked out for the B-Method, though the applicability of the underlying ideas is not limited to just that formalism.