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

Generating efficient test sets with a model checker 使用模型检查器生成有效的测试集

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.21

Grégoire Hamon, L. D. Moura, J. Rushby

引用次数: 124

Care, feeding and growth of software 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.9

M. Joseph

引用次数: 0

Test case generation using stochastic automata networks: quantitative analysis 使用随机自动机网络生成测试用例:定量分析

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.42

C. Bertolini, André G. Farina, Paulo Fernandes, F. Oliveira

引用次数: 19

Towards action refinement for concurrent systems with causal ambiguity 面向因果模糊并发系统的动作细化

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.47

Jinzhao Wu, Houguang Yue

引用次数: 2

Theory and algorithms for the generation and validation of speculative loop optimizations 理论和算法的产生和验证的投机循环优化

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.45

Ying Hu, Clark W. Barrett, B. Goldberg

{"title":"Theory and algorithms for the generation and validation of speculative loop optimizations","authors":"Ying Hu, Clark W. Barrett, B. Goldberg","doi":"10.1109/SEFM.2004.45","DOIUrl":"https://doi.org/10.1109/SEFM.2004.45","url":null,"abstract":"Translation validation is a technique that verifies the results of every run of a translator such as a compiler, instead of the translator itself. Previous papers by the authors and others have described translation validation for compilers that perform loop optimizations (such as interchange, tiling, fusion, etc), using a proof rule that treats loop optimizations as permutations. In this paper we describe an improved permutation proof rule which considers the initial conditions and invariant conditions of the loop. This new proof rule not only improves the validation process for compile-time optimizations, it can also be used to ensure the correctness of speculative loop optimizations, the aggressive optimizations which are only correct under certain conditions that cannot be known at compile time. Based on the new permutation rule, with the help of an automatic theorem prover CVC Lite, an algorithm is proposed for validating loop optimizations. The same permutation proof rule can also be used (within a compiler for example) to generate the runtime tests necessary to support speculative optimizations.","PeriodicalId":207271,"journal":{"name":"Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.","volume":"120 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":"128054340","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}

引用次数: 8

Properties of a formal method for prediction of emergent behaviors in swarm-based 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.34

C. Rouff, A. Vanderbilt, M. Hinchey, W. Truszkowski, J. Rash

引用次数: 48

Formal derivation of functional architectural design 功能建筑设计的形式化推导

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.18

Ridha Khédri, Imen Bourguiba

引用次数: 6

Formal verification of requirements using SPIN: a case study on Web services 使用SPIN对需求进行正式验证:一个关于Web服务的案例研究

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.19

R. Kazhamiakin, M. Pistore, Marco Roveri

{"title":"Formal verification of requirements using SPIN: a case study on Web services","authors":"R. Kazhamiakin, M. Pistore, Marco Roveri","doi":"10.1109/SEFM.2004.19","DOIUrl":"https://doi.org/10.1109/SEFM.2004.19","url":null,"abstract":"In this paper we describe a novel approach for the formal specification and verification of distributed processes in a Web service framework. The formal specification is provided at two different levels of abstraction. The strategic level describes the requirements of the Web service domain, in terms of the different actors participating to it, with their goals and needs and with their mutual dependencies and expectations. The process level shows how these requirements are operationalized into communicating processes running on the different Web servers. We model the strategic level exploiting Formal Tropos (FT), a language for the formal definition of the requirements of agent-oriented systems which is based on linear time logic. We model the process level using Promela, a language designed to describe communicating concurrent processes and amenable to formal verification. We exploit the SPIN model checker to perform V&V tasks. At the strategic level, requirements are validated against queries formulated by the designer while at the process level the Promela specifications are verified against the requirements. The implementation of these V&V tasks requires the definition of a novel procedure to encode the FT requirements in Promela. The experiments described in the paper show that the approach is effective in revealing possible flaws both in the strategic and in the process models.","PeriodicalId":207271,"journal":{"name":"Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.","volume":"11 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":"133965297","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}

引用次数: 55

Decidability results for parametric probabilistic transition systems with an application to security 参数概率转移系统的可决性结果及其在安全领域的应用

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.12

R. Lanotte, A. Maggiolo-Schettini, Angelo Troina

引用次数: 9

Global vs. local model checking: a comparison of verification techniques for infinite state 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.23

T. Schüle, K. Schneider

引用次数: 13