{"title":"Predicting operational behaviour of abstract programs during formal developments","authors":"Y. Ait-Ameur","doi":"10.1109/IWSSD.1993.315501","DOIUrl":"https://doi.org/10.1109/IWSSD.1993.315501","url":null,"abstract":"Several formal approaches for the development of programs have been suggested including the transformational approach which allows to express formal developments as a linear equational proof. These developments lead to produce on the one hand the suited program satisfying its formal initial specifications and, on the other hand, the proof of correctness of this development. In most of the cases, this correctness is concerned with only functional aspects. Operational aspects are taken into account intuitively. This paper deals with nonfunctional correction of software. We suggest a transformational approach which allows the developer to produce cost expressions that can be interpreted in order to evaluate and get the benefit yielded by a given transformation application. These cost expressions are correctly associated to the intermediate objects of the development (abstract programs). We present a classification of the properties which are studied during the development phase and the correct formal transformational process allowing to get a particular evaluator for each kind of nonfunctional properties. Applications are given as well.<<ETX>>","PeriodicalId":259574,"journal":{"name":"Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127605915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An active hypertext model for system requirements","authors":"C. Potts, Kenji Takahashi","doi":"10.1109/IWSSD.1993.315512","DOIUrl":"https://doi.org/10.1109/IWSSD.1993.315512","url":null,"abstract":"We are developing tools to support a conversational metaphor for requirements definition and analysis. Our conversational model consists of three components: (1) a hypertextual representation of requirements and their interrelations, (2) an issue-based speech act model, and (3) a typology of changes. These components act together in a model we call the 'inquiry cycle'. We discuss requirements analysis activities supported by the conversational model, including information retrieval and navigation, rationale management, and agenda management. We have implemented a prototype active hypertext system, and we have applied our model and implementation to the requirements for an ATM banking system, an example we use in the paper for illustration.<<ETX>>","PeriodicalId":259574,"journal":{"name":"Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design","volume":"45 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121002248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An incremental approach to reachability analysis of distributed programs","authors":"K. Tai, P. Koppol","doi":"10.1109/IWSSD.1993.315504","DOIUrl":"https://doi.org/10.1109/IWSSD.1993.315504","url":null,"abstract":"We present an incremental approach to reachability analysis of distributed programs with synchronous communication and mailbox naming. Each process in a distributed program can be modeled as a communicating finite state machine (CFSM). A set of CFSMs is organized into a hierarchy. We present an algorithm that, for a given hierarchy of a set M of CFSMs, incrementally composes and reduces subsets of CFSMs in M. This incremental reachability analysis guarantees the detection of global deadlocks. We provide an algorithm for selecting a hierarchy for a set of CFSMs and show an incremental analysis of the gas station problem.<<ETX>>","PeriodicalId":259574,"journal":{"name":"Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127133397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}