{"title":"逆向工程分布式算法","authors":"K. Sere, M. Waldén","doi":"10.1002/(SICI)1096-908X(199603)8:2%3C117::AID-SMR126%3E3.0.CO;2-I","DOIUrl":null,"url":null,"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.","PeriodicalId":383619,"journal":{"name":"J. Softw. Maintenance Res. Pract.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Reverse Engineering Distributed Algorithms\",\"authors\":\"K. Sere, M. Waldén\",\"doi\":\"10.1002/(SICI)1096-908X(199603)8:2%3C117::AID-SMR126%3E3.0.CO;2-I\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":383619,\"journal\":{\"name\":\"J. Softw. Maintenance Res. Pract.\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-03-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Softw. Maintenance Res. Pract.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/(SICI)1096-908X(199603)8:2%3C117::AID-SMR126%3E3.0.CO;2-I\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Softw. Maintenance Res. Pract.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/(SICI)1096-908X(199603)8:2%3C117::AID-SMR126%3E3.0.CO;2-I","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.