发布求助
文献互助 智能选刊 最新文献

2010 Third International Conference on Software Testing, Verification, and Validation Workshops最新文献

筛选
英文 中文
Test Generation Based on Abstraction and Test Purposes to Complement Structural Tests 基于抽象和测试目的的测试生成，以补充结构测试
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.47
F. Bouquet, Pierre-Christophe Bué, J. Julliand, P. Masson
{"title":"Test Generation Based on Abstraction and Test Purposes to Complement Structural Tests","authors":"F. Bouquet, Pierre-Christophe Bué, J. Julliand, P. Masson","doi":"10.1109/ICSTW.2010.47","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.47","url":null,"abstract":"This paper presents a computer aided model-based test generation method. We propose this approach as a complement to the LTG (Leirios Test Generator) method, which extracts functional tests out of a formal behavioral model M by means of static (or structural) selection criteria. Our method computes additional tests by applying dynamic (or behavioral) selection criteria (test purposes called TP). Applying TP directly to M is usually not possible for industrial applications due to the huge (possibly infinite) size of their state space. We compute an abstraction A of M by predicate abstraction. We propose a method to define a set of abstraction predicates from information of TP. We generate symbolic tests from A by using TP as a dynamic selection criterion. Then we instantiate them on M, which allows us play the tests on the implementation the same way as we play the functional ones. Our experimental results show that our tests are complementary to the structural ones.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128496283","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
Towards Security Vulnerability Detection by Source Code Model Checking 基于源代码模型检测的安全漏洞检测研究
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.23
Keqin Li
{"title":"Towards Security Vulnerability Detection by Source Code Model Checking","authors":"Keqin Li","doi":"10.1109/ICSTW.2010.23","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.23","url":null,"abstract":"Security in code level is an important aspect to achieve high quality software. Various security programming guidelines are defined to improve the quality of software code. At the same time, enforcing mechanisms of these guidelines are needed. In this paper, we use source code model checking technique to check whether some security programming guidelines are followed, and correspondingly to detect related security vulnerabilities. Two SAP security programming guidelines related to logging sensitive information and Cross-Site Scripting attack are used as examples. In the case studies, Bandera Tool Set is used as source code model checker, and minimizing programmers' additional effort is set as one of the goals.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125991222","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}
引用次数: 9
A Comparison of Constraint-Based and Sequence-Based Generation of Complex Input Data Structures 基于约束和基于序列的复杂输入数据结构生成的比较
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.7
Rohan Sharma, Miloš Gligorić, V. Jagannath, D. Marinov
{"title":"A Comparison of Constraint-Based and Sequence-Based Generation of Complex Input Data Structures","authors":"Rohan Sharma, Miloš Gligorić, V. Jagannath, D. Marinov","doi":"10.1109/ICSTW.2010.7","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.7","url":null,"abstract":"Generation of complex input data structures is one of the challenging tasks in testing. Manual generation of such structures is tedious and error-prone. Automated generation approaches include those based on constraints, which generate structures at the concrete representation level, and those based on sequences of operations, which generate structures at the abstract representation level by inserting or removing elements to or from the structure. In this paper, we compare these two approaches for five complex data structures used in previous research studies. Our experiments show several interesting results. First, constraint-based generation can generate more structures than sequence-based generation. Second, the extra structures can lead to false alarms in testing. Third, some concrete representations of structures cannot be generated only with sequences of insert operations. Fourth, slightly different implementations of the same data structure can behave differently in testing.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120840042","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}
引用次数: 15
SAT Solvers for Queries over Tree Automata with Constraints 带约束的树自动机查询的SAT求解器
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.17
Pierre-Cyrille Héam, Vincent Hugot, O. Kouchnarenko
{"title":"SAT Solvers for Queries over Tree Automata with Constraints","authors":"Pierre-Cyrille Héam, Vincent Hugot, O. Kouchnarenko","doi":"10.1109/ICSTW.2010.17","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.17","url":null,"abstract":"Tree automata turned out to be a very convenient framework for modeling and proving properties on infinite systems like communication protocols, Java programs and also in the context of XML programming. Unfortunately, these works are not always supported by efficient verification and validation tools. This paper investigates the use of two SAT solvers --- MiniSat and picoSat --- to evaluate queries over tree automata with global equality and disequality constraints (TAGEDs for short). Unlike general tree automata, TAGEDs allow to express constraints useful for e.g., evaluating queries over XML documents, like 'in the document, two nodes do not have the same key'. These queries being based on the membership problem which is NP-complete for TAGEDs, we propose an efficient SAT encoding of the membership problem for TAGEDs and we show its correctness and soundness. The paper reports on the experimental results, and implementation details are given.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123028233","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
Software Testing Using Test Sheets 使用测试表进行软件测试
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.21
C. Atkinson, Florian Barth, D. Brenner
{"title":"Software Testing Using Test Sheets","authors":"C. Atkinson, Florian Barth, D. Brenner","doi":"10.1109/ICSTW.2010.21","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.21","url":null,"abstract":"Although testing is one of the most important activities in software development, especially in projects which emphasize agile development, the basic approach used to define and report tests has changed little since JUnit was introduced over a decade ago. JUnit and its derivatives such as NUnit significantly simplify the task of programming tests but still leave the test logic tangled up with program scaffolding, making it difficult to see and validate. On the other hand, recently introduced validation oriented approaches, such as FIT, provide a much more concise and easy to understand description of test logic, but cannot cope with code-level testing. In this paper we present a new metaphor for test definition and reporting, referred to as \"test sheets\", that combines the expressive strength of JUnit with the visual simplicity of tabular approaches such as FIT. After discussing the strengths and weaknesses of the technologies used today we present the test sheet approach using some simple examples.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132500690","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
Mutation at System and Functional Levels 系统和功能层面的突变
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.18
Pedro Reales Mateo, Macario Polo, A. Offutt
{"title":"Mutation at System and Functional Levels","authors":"Pedro Reales Mateo, Macario Polo, A. Offutt","doi":"10.1109/ICSTW.2010.18","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.18","url":null,"abstract":"Mutation analysis has been applied to many testing problems, including functional programs in numerous languages, specifications, network protocols, web services, and security policies. Program mutation, where mutation analysis is applied to programs, has been applied to the unit level (functions and methods), integration of pairs of functions, and individual classes. However, program mutation has not been applied to the problem of testing multiple classes or entire software programs, that is, there is no system level mutation. This paper introduces a project on the problem of multi-class and system level mutation testing. The technical differences between using mutation to test single classes and multiple classes are explored, and new system level mutation operators are defined. A new execution style for detecting killed mutants, Flexible Weak Mutation, is introduced. A support tool, Bacterio, is currently under construction.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134395317","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}
引用次数: 34
Some Modeling Challenges When Testing Rich Internet Applications for Security 测试富互联网应用程序安全性时的一些建模挑战
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.46
Kamara Benjamin, G. Bochmann, Guy-Vincent Jourdan, Iosif-Viorel Onut
{"title":"Some Modeling Challenges When Testing Rich Internet Applications for Security","authors":"Kamara Benjamin, G. Bochmann, Guy-Vincent Jourdan, Iosif-Viorel Onut","doi":"10.1109/ICSTW.2010.46","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.46","url":null,"abstract":"Web-based applications are becoming more ubiquitous day by day, and among these applications, a new trend is emerging: rich Internet applications (RIAs), using technologies such as Ajax, Flex, or Silverlight, break away from the traditional approach of Web applications having server-side computation and synchronous communications between the web client and servers. RIAs introduce new challenges, new security vulnerabilities, and their behavior makes it difficult or impossible to test with current web-application security scanners. A new model is required to enable automated scanning of RIAs for security. In this paper, we evaluate the shortcomings of current approaches, we elaborate a framework that would permit automated scanning of RIAs, and we provide some directions to address the open problems.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133192798","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}
引用次数: 21
Implementation-Oriented Mutation Testing of Statechart Models 面向实现的状态图模型突变测试
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.55
M. Trakhtenbrot
{"title":"Implementation-Oriented Mutation Testing of Statechart Models","authors":"M. Trakhtenbrot","doi":"10.1109/ICSTW.2010.55","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.55","url":null,"abstract":"Executable statecharts-based models of embedded real-time systems provide a solid basis for early detection of behavioral errors. However, there are two major semantic gaps between execution of system model and execution of its actual implementation. One is treating of time: simulated time (where every reaction to environment stimuli takes zero time) vs. running in real time. Another one relates to \"maximum parallelism\" of statechart components vs. actual concurrent tasks running under certain scheduler. As a result, test set that is adequate for system model might be non-adequate for system implementation. This paper presents a series of statechart mutations that allows to address the above differences and to evaluate \"implementation oriented\" adequacy of tests.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130464345","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
Optimizing for the Number of Tests Generated in Search Based Test Data Generation with an Application to the Oracle Cost Problem 针对Oracle成本问题的应用程序，优化基于搜索的测试数据生成中生成的测试数量
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.31
M. Harman, Sung Gon Kim, Kiran Lakhotia, Phil McMinn, S. Yoo
{"title":"Optimizing for the Number of Tests Generated in Search Based Test Data Generation with an Application to the Oracle Cost Problem","authors":"M. Harman, Sung Gon Kim, Kiran Lakhotia, Phil McMinn, S. Yoo","doi":"10.1109/ICSTW.2010.31","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.31","url":null,"abstract":"Previous approaches to search based test data generation tend to focus on coverage, rather than oracle cost. While there may be an aspiration that systems should have models, checkable specifications and/or contract driven development, this sadly remains an aspiration; in many real cases, system behaviour must be checked by a human. This painstaking checking process forms a significant cost, the oracle cost, which previous work on automated test data generation tends to overlook. One simple way to reduce oracle cost consists of reducing the number of tests generated. In this paper we introduce three algorithms which do this without compromising coverage achieved. We present the results of an empirical study of the effectiveness of the three algorithms on five benchmark programs containing non trivial search spaces for branch coverage. The results indicate that it is, indeed, possible to make reductions in the number of test cases produced by search based testing, without loss of coverage.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116324042","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}
引用次数: 100
Overcoming Obstacles to Test-Driven Learning on Day One 第一天克服考试驱动学习的障碍
2010 Third International Conference on Software Testing, Verification, and Validation Workshops Pub Date : 2010-04-06 DOI: 10.1109/ICSTW.2010.33
John Clements, David S. Janzen
{"title":"Overcoming Obstacles to Test-Driven Learning on Day One","authors":"John Clements, David S. Janzen","doi":"10.1109/ICSTW.2010.33","DOIUrl":"https://doi.org/10.1109/ICSTW.2010.33","url":null,"abstract":"We describe the preliminary construction of a web-based tool for test-driven learning in the first weeks of programming. We discuss obstacles to test-driven learning--both pragmatic and ideological--and describe the ways that we believe our tool overcomes these obstacles.","PeriodicalId":117410,"journal":{"name":"2010 Third International Conference on Software Testing, Verification, and Validation Workshops","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114189197","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信