Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.最新文献_第4页

Distributed testing of multi input/output transition system 多输入/输出转换系统的分布式测试

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-28 DOI: 10.1109/SEFM.2004.13

Zhongjie Li, Xia Yin, Jianping Wu

引用次数: 3

Symbolic verification of infinite systems using a finite union of DFAs 用dfa的有限并的无穷系统的符号验证

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-28 DOI: 10.1109/SEFM.2004.40

Suman Roy

{"title":"Symbolic verification of infinite systems using a finite union of DFAs","authors":"Suman Roy","doi":"10.1109/SEFM.2004.40","DOIUrl":"https://doi.org/10.1109/SEFM.2004.40","url":null,"abstract":"We address the verification problem of FIFO channel systems by applying the symbolic analysis principle. Communication protocols can be modelled by a finite set of finite-state machines (CFSMs) that communicate between each other by exchanging messages via unbounded FIFO channels/queues. A Finite Union of Deterministic Finite Automata (FUDFA) is used to represent (possibly) infinite set of queue contents. Quite a few operations needed to symbolically analyze such systems can be implemented on the union of DFAs in polynomial time. The advantage gained by this approach is that the inclusion between finite unions DFAs can be checked efficiently. We show that FUDFAs can be used for the for-ward and backward reachability analysis of the systems. It also lifts this approach for the case of a protocol with n queues. We use this fact to define a generic reachability analysis semi-algorithm parameterized by a set of cycles /spl Theta/. Given a set of configurations, this semi-algorithm performs a least fix-point calculation to construct the set of its successors (or predecessors). At each step, the search is accelerated by considering the cycles in /spl Theta/ as additional \"meta-transitions\", an approach adopted similar in nature to that proposed by Boigelot and Godefroid.","PeriodicalId":207271,"journal":{"name":"Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115598768","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}

引用次数: 1

Finding the causes of unrealizability of reactive system formal specifications 找出反应性系统形式化规范无法实现的原因

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-28 DOI: 10.1109/SEFM.2004.17

N. Yoshiura

{"title":"Finding the causes of unrealizability of reactive system formal specifications","authors":"N. Yoshiura","doi":"10.1109/SEFM.2004.17","DOIUrl":"https://doi.org/10.1109/SEFM.2004.17","url":null,"abstract":"Reactive systems are the systems that maintain some interaction with their environment. Temporal logic is one of the methods for formal specification descriptions of reactive systems. The formal specifications of reactive systems enables to check the consistency of the specifications and whether they contain defects. By using a synthesis algorithm we also obtain reactive system programs from the formal specifications and prevent programming bugs. Thus, it is important to describe reactive system formal specifications. However, it is difficult to describe realizable reactive system specifications and it is necessary to find the causes of unrealizable reactive system specifications. In previous research, three properties have been introduced into unrealizable reactive system specifications and we suppose that this classification gives the hists of finding the causes of unrealizability. In this paper we propose several heuristics of finding the causes of unrealizability of reactive system formal specifications. To find the causes, we use tableau methods and the classification of the reactive system specifications.","PeriodicalId":207271,"journal":{"name":"Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132079485","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

On semantics and refinement of UML statecharts: a coalgebraic view 关于UML状态图的语义和细化:一个共代数视图

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-28 DOI: 10.1109/SEFM.2004.28

S. Meng, Naixiao Zhang, L. Barbosa

引用次数: 29

How to verify dynamic properties of information systems 如何验证信息系统的动态特性

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-28 DOI: 10.1109/SEFM.2004.25

N. Evans, H. Treharne, Régine Laleau, M. Frappier

引用次数: 17

Modeling peer-to-peer service goals in UML 用UML对对等服务目标建模

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-28 DOI: 10.1109/SEFM.2004.26

R. Sanders, Rolv Bræk

引用次数: 16

Glass-box and black-box views on object-oriented specifications 面向对象规范的玻璃盒和黑盒视图

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-28 DOI: 10.1109/SEFM.2004.22

M. Bidoit, R. Hennicker, Alexander Knapp, H. Baumeister

引用次数: 9

The Rhapsody UML Verification Environment Rhapsody UML验证环境

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-28 DOI: 10.1109/SEFM.2004.44

Ingo Schinz, Tobe Toben, C. Mrugalla, B. Westphal

引用次数: 73

Property-driven development Property-driven发展

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-28 DOI: 10.1109/SEFM.2004.35

H. Baumeister, Alexander Knapp, M. Wirsing

{"title":"Property-driven development","authors":"H. Baumeister, Alexander Knapp, M. Wirsing","doi":"10.1109/SEFM.2004.35","DOIUrl":"https://doi.org/10.1109/SEFM.2004.35","url":null,"abstract":"Early test development and specification enhance the quality and robustness of software as experience with agile software development methods shows. The methods propagate test-first techniques and early prototyping through executable design models. We propose to enhance test-driven development to a more general property-driven development technique: Property-driven development ties together automatic tests, formal specification, and executable UML models by developing these three views together instead of one after the other as is common practice. Scenarios and properties serve as a combined basis for system specification and test cases. By extracting common properties of several scenarios we obtain invariants and pre- and postconditions. The behavior of the system is described UML state machines. For testing we insert invariants and pre- and postconditions as assertions in the code generated from the state machines. For verification, we use model checking. For this we have to restrict the models to finite domains. Therefore we construct suitable abstractions of the scenarios and the system behavior and verify the abstractions using a model checker.","PeriodicalId":207271,"journal":{"name":"Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133859099","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}

引用次数: 12

Towards formalizing behavioral substitutability in component frameworks 朝着在组件框架中形式化行为可替代性的方向发展

Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004. Pub Date : 2004-09-01 DOI: 10.1109/SEFM.2004.48

S. Moisan, Annie Ressouche, J. Rigault

引用次数: 8