FAuST: A Framework for Formal Verification, Automated Debugging, and Software Test Generation

Riener, Heinz; Fey, Görschwin

doi:10.1007/978-3-642-31759-0_17

Cited by 3 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First approach is based on instrumentation of the tested application in order to enable a simple observation of its behavior. Examples include wrappers around tested functions or methods (e.g., in [40]) or probes near important points of the program, such as control structures (e.g., in [41]), usage of augmented virtual machines (e.g., LLVM [42]), or usage of runtime instrumentation (e.g., in [43]).…”

Section: Program Execution Analysis Methodsmentioning

confidence: 99%

“…The generally utilizable methods also form just the largest group with 19 papers (e.g., [23] or [39]). The specific target platform with the largest number of papers was Java language (18 papers, e.g., [59] or [81]) followed by C/C++ languages (14 papers, e.g., [28] or [42]). Further groups include C#/.NET platform (2 papers - [48] and [56]), web applications (6 papers, e.g., [26] or [55]), databases (DB -2 papers - [61] and [77]), and programmable logic controllers (PLCs -2 papers - [46] and [47]).…”

Section: Target Platformmentioning

confidence: 99%

See 1 more Smart Citation

Current Trends in Automated Test Case Generation

Potuzak,

Lipka

2023

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

The testing is an integral part of the software development. At the same time, the manual creation of individu-al test cases is a lengthy and error-prone process. Hence, an intensive research on automated test generation methods is ongoing for more than twenty years. There are many vastly dif-ferent approaches, which can be considered automated test case generation. However, a common feature is the generation of the data for the test cases. Ultimately, the test data decide the prog-ram branching and can be used on any testing level, starting with the unit tests and ending with the tests focused on the behavior of the entire application. The test data are also mostly independent on any specific technology, such as programming language or paradigm. This paper is a survey of existing litera-ture of the last two decades that deals with test data generation or with tests based on it. This survey is not a systematic literature review and it does not try to answer specific scientific questions formulated in advance. Its purpose is to map and categorize the existing methods and to summarize their common features. Such a survey can be helpful for any teams developing their methods for test data generation as it can be a starting point for the exploration of related work.Index terms-Software testing, test case generation, test data generation, papers survey.

show abstract

Section: Program Execution Analysis Methodsmentioning

confidence: 99%

Section: Target Platformmentioning

confidence: 99%

Current Trends in Automated Test Case Generation

Potuzak,

Lipka

2023

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

show abstract

First Steps towards Deductive Verification of LLVM IR

van Oorschot,

Huisman,

Şakar

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Over the last years, deductive program verifiers have substantially improved, and their applicability on non-trivial applications has been demonstrated. However, a major bottleneck is that for every new programming language, a new deductive verifier has to be built.This paper describes the first steps in a project that aims to address this problem, by language-agnostic support for deductive verification: Rather than building a deductive program verifier for every programming language, we develop deductive program verification technology for a widely-used intermediate representation language (LLVM IR), such that we eventually get verification support for any language that can be compiled into the LLVM IR format.Concretely, this paper describes the design of VCLLVM, a prototype tool that adds LLVM IR as a supported language to the VerCors verifier. We discuss the challenges that have to be addressed to develop verification support for such a low-level language. Moreover, we also sketch how we envisage to build verification support for any specified source program that can be compiled into LLVM IR on top of VCLLVM.

show abstract

Mutation testing of memory-related operators

Nanavati

Harman

et al. 2015

2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW)

View full text Add to dashboard Cite

Though mutation operators have been designed for a wide range of programming languages in the last three decades, only a few operators are able to simulate memory faults. This paper introduces 9 Memory Mutation Operators targeting common memory faults. We report the results of an empirical study using 16 open source programs, which come with well designed unit test suites. We find only 44% of the new memory mutants introduced are captured by the traditional strong mutation killing criterion. We thus further introduce two new killing criteria, the Memory Fault Detection and the Control Flow Deviation killing criteria to augment the traditional strong mutation testing criterion. Our results show that the two new killing criteria are more effective at detecting memory mutants, killing between 10% and 75% of those mutants left unkilled by the traditional criterion.

show abstract

FAuST: A Framework for Formal Verification, Automated Debugging, and Software Test Generation

Cited by 3 publications

References 21 publications

Current Trends in Automated Test Case Generation

Current Trends in Automated Test Case Generation

First Steps towards Deductive Verification of LLVM IR

Mutation testing of memory-related operators

Contact Info

Product

Resources

About