In Search-based Software Testing (SBST), test generation is guided by fitness functions that
estimate how close a test case is to reach an uncovered test goal (eg, branch). A popular …

Analyzing loops is very important for various software engineering tasks such as bug
detection, test case generation and program optimization. However, loops are very …

Termination is a crucial program property. Non-termination bugs can be subtle to detect and
may remain hidden for long before they take effect. Many real-world programs still suffer …

Real-time embedded devices like medical or industrial devices are increasingly targeted by
cyber-attacks. Prompt patching is crucial to mitigate the serious consequences of such …

Detecting non-termination is crucial for ensuring program correctness and security, such as
preventing denial-of-service attacks. While termination analysis has been studied for many …

As the global community advocates for the adoption of memory-safe programming
languages, a significant research gap persists in identifying the critical vulnerabilities that …

Several techniques have been developed to prove the termination of programs. Finding
ranking functions is one of the common approaches to do so. A ranking function must be …

Array, as a fundamental data structure, is widely used in programs. Automated reasoning
about arrays needs to discover properties about ranges of elements at certain program …

Software vulnerability has become a major threat to software security. Works have been
proposed to search for vulnerabilities in both source code and binary programs. Code clone …

Loops are commonly-used control structures in real-world programs and make it convenient
for programmers to implement complex functionalities of program. However, the incorrect …