Proceedings 1996 Asia-Pacific Software Engineering Conference最新文献_第4页

Formalization and verification of safety properties of Statechart specifications 形式化和验证Statechart规范的安全属性

Proceedings 1996 Asia-Pacific Software Engineering Conference Pub Date : 1996-12-04 DOI: 10.1109/APSEC.1996.566736

K. Kang, Kwang-Il Ko

{"title":"Formalization and verification of safety properties of Statechart specifications","authors":"K. Kang, Kwang-Il Ko","doi":"10.1109/APSEC.1996.566736","DOIUrl":"https://doi.org/10.1109/APSEC.1996.566736","url":null,"abstract":"There have been many analysis methods proposed for the verification of safety properties of real-time systems. Most of these methods, however, are not powerful enough for complex and safety-critical real-time systems due mainly to the lack of language primitives for specifying complex requirements (e.g., ESM) or heuristic verification procedures that do not provide verification results with certainty (e.g., Statechart and Modechart). A new approach for the verification of safety properties of real-time systems is introduced. This approach adopts Statechart to specify real-time systems behaviors. The authors redefined the step semantics of Statechart to address the problems of the synchrony hypothesis inherent to the original step semantics. A operational semantics of Statechart is defined based on the step semantics and a verification method for safety properties is developed based on the operational semantics of Statechart. This method verifies safety properties using a reachability graph derived from a Statechart diagram. They did not sacrifice the practicality or expressive power of Statechart for the simplification of analysis. Useful event and action primitives including the timeout event tm() and scheduled-action sc!() are included in the analysis. A train gate system is used as an example to illustrate the concepts in the paper.","PeriodicalId":407476,"journal":{"name":"Proceedings 1996 Asia-Pacific Software Engineering Conference","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130947304","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}

引用次数: 7

The derivation of functional specifications from source code 从源代码派生功能规范

Proceedings 1996 Asia-Pacific Software Engineering Conference Pub Date : 1996-12-04 DOI: 10.1109/APSEC.1996.566751

W. Howden, S. Pak

引用次数: 5

Software testing and metrics for concurrent computation 并发计算的软件测试和度量

Proceedings 1996 Asia-Pacific Software Engineering Conference Pub Date : 1996-12-04 DOI: 10.1109/APSEC.1996.566768

C. Chung, T. Shih, Ying-Hong Wang, Wei-Chuan Lin, Ying-Feng Kuo

{"title":"Software testing and metrics for concurrent computation","authors":"C. Chung, T. Shih, Ying-Hong Wang, Wei-Chuan Lin, Ying-Feng Kuo","doi":"10.1109/APSEC.1996.566768","DOIUrl":"https://doi.org/10.1109/APSEC.1996.566768","url":null,"abstract":"Verification and validation are two important technologies to assure the reliability and quality of software. Software testing and metrics are two approaches to execute the verification and validation. In sequential computation, a fairly mature process exists, with various methodologies and tools available for use in building and demonstrating the correctness of a program being tested. The emergence of concurrent computation in recent years, however, introduces new testing problems and difficulties that cannot be solved by the traditional sequential program testing techniques. Many concurrent program testing methodologies have been proposed to solve controlled execution and determinism. There have been few discussions of concurrent software testing from the inter-task viewpoint, even though the common characteristics of concurrent programming are the explicit identification of the large-grain parallel computation units (tasks) and the explicit inter-task communication via a rendezvous-style mechanism. In this paper, we focus on testing concurrent programs through task decomposition. We propose four testing criteria to test a concurrent program. A programmer can choose an appropriate testing strategy depending on the properties of the concurrent programs. Associated with the strategies, four equations are provided to measure the complexity of concurrent programs.","PeriodicalId":407476,"journal":{"name":"Proceedings 1996 Asia-Pacific Software Engineering Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115702944","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}

引用次数: 5

A class testing technique based on data bindings 一种基于数据绑定的类测试技术

Proceedings 1996 Asia-Pacific Software Engineering Conference Pub Date : 1996-12-04 DOI: 10.1109/APSEC.1996.566745

Heechern Kim, Chisu Wu

引用次数: 7

Formalisation of interaction diagrams 交互图的形式化

Proceedings 1996 Asia-Pacific Software Engineering Conference Pub Date : 1996-12-04 DOI: 10.1109/APSEC.1996.566766

R. Rönnquist, Chi Keen Low

{"title":"Formalisation of interaction diagrams","authors":"R. Rönnquist, Chi Keen Low","doi":"10.1109/APSEC.1996.566766","DOIUrl":"https://doi.org/10.1109/APSEC.1996.566766","url":null,"abstract":"An interaction diagram is a graphical view of computation processes and communication between entities. In concurrent object-oriented systems and multi-agent systems, it can be used as a graphical language in designing the communication between concurrent objects or agents. By formalising the diagrams, automated translation could be used to generate code, to produce reports and to test a complete system. In this paper, we present a graph algebra in which the diagrams are expressed as compositions of interconnected components according to their intended interpretations. We show how a diagram is converted into its algebraic form (a \"fragmentation\"). The conversion can also be reversed, so that we can graphically represent a fragmentation by an interaction diagram. There are two equivalent forms of fragmentations that are used for different purposes. Computation flow fragmentation is used to describe the computation processes of one particular object or agent. Message flow fragmentation can capture the communication between objects or agents. We show that they are equivalent and describe steps to translate one form to another so that we can manipulate and analyse fragmentations in either form. With the formalism of interaction diagrams and fragmentations, we can develop automated procedures and tools for using interaction diagrams in the development of concurrent object-oriented systems and multi-agent systems.","PeriodicalId":407476,"journal":{"name":"Proceedings 1996 Asia-Pacific Software Engineering Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128278952","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}

引用次数: 4

Formal methods pilot project 正式方法试点项目

Proceedings 1996 Asia-Pacific Software Engineering Conference Pub Date : 1996-12-04 DOI: 10.1109/APSEC.1996.566758

Tracey Hart, F. Linn, R. Morello, Greg Royle, P. Kearney, P. Lindsay, K. Ross, O. Traynor

引用次数: 4

M-base: an application development environment for end-user computing based on message flow M-base:基于消息流的最终用户计算的应用程序开发环境

Proceedings 1996 Asia-Pacific Software Engineering Conference Pub Date : 1996-12-04 DOI: 10.1109/APSEC.1996.566771

Takeshi Chusho, Yuji Konishi, M. Yoshioka

引用次数: 2