Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Proving entailment between conceptual state specifications
Theoretical Computer Science - First European Symposium on Programming, Saarbru:9Aicken, W. Germany, March 17:8
Parallel program design: a foundation
Parallel program design: a foundation
Understanding and verifying distributed algorithms using stratified decomposition
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Synchronization and control of distributed systems and programs
Synchronization and control of distributed systems and programs
Interleaving set temporal logic
Theoretical Computer Science
The existence of refinement mappings
Theoretical Computer Science
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
ACM Computing Surveys (CSUR)
Program development by stepwise refinement
Communications of the ACM
Simulations Between Specifications of Distributed Systems
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Preserving Specific Properties in Programm Development: How to Debug Programs (Conference Version)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Protocol Design by Layered Decomposition: A Compositional Approach
Proceedings of the Second International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Extending the Limits of Sequentially Phased Reasoning
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Foundations of Compositional Program Refinement - Safety Properties
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Forward and Backward Simulations for Timing-Based Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Refinement and Projection of Relational Specifications
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Verification of distributed programs using representative interleaving sequences
Distributed Computing
Proving refinement using transduction
Distributed Computing - Special issue: Verification of lazy caching
| Hi-index | 0.00 |
One of the major development strategies for concurrent systems suggests to start the system development from a socalled functional design of the envisaged system and to distribute/parallelize this design in subsequent development steps towards a concurrent system. In this paper we argue that this strategy is not supported by the standard state-based refinement approaches. This phenomenon is traced back to the fact that these approaches are constructed such that necessarily all temporal properties of the refined system are preserved during refinement. We explain that the key feature of a suitable refinement notion for the above strategy has to relax this strict preservation of properties. Rather than preserving all temporal properties of the refined system the required refinement notion has to support the exclusive preservation of specific properties. We present such a refinement approach and prove that the standard state-based refinement relations are particular instances of the advocated notion.