Symbiotic 10: Lazy Memory Initialization and Compact Symbolic Execution: (Competition Contribution)

M Jonáš, K Kumor, J Novák, J Sedláček, M Trtík… - … Conference on Tools …, 2024 - Springer
Symbiotic 10 brings four substantial improvements. First, we extended our clone of Klee
called JetKlee with lazy memory initialization. With this extension, JetKlee can symbolically …

Symbiotic 9: String Analysis and Backward Symbolic Execution with Loop Folding: (Competition Contribution)

M Chalupa, V Mihalkovič, A Řechtáčková… - … Conference on Tools …, 2022 - Springer
The development of Symbiotic 9 focused mainly on two components. One is the symbolic
executor Slowbeast, which newly supports backward symbolic execution including its …

Bubaak: Runtime Monitoring of Program Verifiers: (Competition Contribution)

M Chalupa, TA Henzinger - … Conference on Tools and Algorithms for the …, 2023 - Springer
The main idea behind Bubaak is to run multiple program analyses in parallel and use
runtime monitoring and enforcement to observe and control their progress in real time. The …

Bubaak-SpLit: Split what you cannot verify (Competition contribution)

M Chalupa, C Richter - International Conference on Tools and Algorithms …, 2024 - Springer
Bubaak-SpLit is a tool for dynamically splitting verification tasks into parts that can then be
analyzed in parallel. It is built on top of Bubaak, a tool designed for running combinations of …

Detecting Buggy Contracts via Smart Testing

SJ Wang, J Yao, K Pei, H Takahashi, J Yang - arxiv preprint arxiv …, 2024 - arxiv.org
Smart contracts are susceptible to critical vulnerabilities. Hybrid dynamic analyses, such as
concolic execution assisted fuzzing and foundation model assisted fuzzing, have emerged …

Ranged program analysis via instrumentation

J Haltermann, MC Jakobs, C Richter… - … Conference on Software …, 2023 - Springer
Ranged program analysis has recently been proposed as a means to scale a single
analysis and to define parallel cooperation of different analyses. To this end, ranged …

Precise Compositional Buffer Overflow Detection via Heap Disjointness

Y Guo, P Yao, C Zhang - Proceedings of the 33rd ACM SIGSOFT …, 2024 - dl.acm.org
Static analysis techniques for buffer overflow detection still struggle with being scalable for
millions of lines of code, while being precise enough to have an acceptable false positive …

Knowledge transfer based many-objective approach for finding bugs in multi-path loops

SD Semujju, F Liu, H Huang, Y **ang, X Yan… - Complex & Intelligent …, 2024 - Springer
Generating test cases is essential for discovering software bugs. However, finding bugs in
multi-path loops is challenging, especially when bugs can only be exposed after a specific …

Low-Level Reachability Analysis Based on Formal Logic

N Naus, F Verbeek, M Schoolderman… - … Conference on Tests and …, 2023 - Springer
Reachability is an important problem in program analysis. Automatically being able to show
that–and how–a certain state is reachable, can be used to detect bugs and vulnerabilities …

Multi-Pass Targeted Dynamic Symbolic Execution

T Yavuz - arxiv preprint arxiv:2408.07797, 2024 - arxiv.org
Dynamic symbolic execution (DSE) provides a precise means to analyze programs and it
can be used to generate test cases and to detect a variety of bugs including memory …