Abstract
Recently, formal approaches to reverse engineering have received considerable
attention as a means of creating correct high level specifications. We show how a formal approach to reverse engineering can be applied when constructing distributed systems, eg. if we want to reuse an existing algorithm, but in a different environment, or develop a new distributed algorithm that is somehow similar to an existing one. We introduce a formal approach to reverse engineering that is dedicated to distributed systems. Our approach is based on a technique we call coarsement. The idea is that an implementation is stepwise turned into a high level specification through a number of intermediate coarsement steps that abstract away the details while preserving the behaviour of the implementation.
attention as a means of creating correct high level specifications. We show how a formal approach to reverse engineering can be applied when constructing distributed systems, eg. if we want to reuse an existing algorithm, but in a different environment, or develop a new distributed algorithm that is somehow similar to an existing one. We introduce a formal approach to reverse engineering that is dedicated to distributed systems. Our approach is based on a technique we call coarsement. The idea is that an implementation is stepwise turned into a high level specification through a number of intermediate coarsement steps that abstract away the details while preserving the behaviour of the implementation.
| Original language | English |
|---|---|
| Pages (from-to) | 117-144 |
| Journal | Journal of Software Maintenance: Research and Practice |
| Volume | 8 |
| Issue number | 2 |
| Publication status | Published - 1996 |
| MoE publication type | A1 Journal article-refereed |
Fingerprint
Dive into the research topics of 'Reverse engineering Distributed Algorithms'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver