Web end-to-end (e2e) testing evaluates the workflow of a web application. It simulates real-world user scenarios to ensure that the application flows behave as expected. However, web e2e tests are notorious for being flaky, \ie the tests can produce inconsistent results despite no changes to the code. One common type of flakiness is caused by nondeterministic execution orders between the test code and the client-side code under test. In particular, UI-based flakiness emerges as a notably prevalent and challenging issue to fix because the test code has limited knowledge about the client-side code execution. In this paper, we propose WEFix, a technique that can automatically generate fixes for UI-based flakiness in web e2e testing. The core of our approach is to leverage browser UI changes to predict the client-side code execution and generate proper wait oracles. We evaluate the effectiveness and efficiency of WEFix against 122 web e2e flaky tests from seven popular real-world projects. Our results show that WEFix dramatically reduces the overhead (from 3.7× to 1.25×) while achieving a high correctness (98%).
We investigate Benford’s law in relation to fractal geometry. Basic fractals, such as the Cantor set and Sierpinski triangle are obtained as the limit of iterative sets, and the unique measures of their components follow a geometric distribution, which is Benford in most bases. Building on this intuition, we aim to study this distribution in more complicated fractals. We examine the Laurent coefficients of a Riemann mapping and the Taylor coefficients of its reciprocal function from the exterior of the Mandelbrot set to the complement of the unit disk. These coefficients are 2-adic rational numbers, and through statistical testing, we demonstrate that the numerators and denominators are a good fit for Benford’s law. We offer additional conjectures and observations about these coefficients. In particular, we highlight certain arithmetic subsequences related to the coefficients’ denominators, provide an estimate for their slope, and describe efficient methods to compute them.
18 May 2026 in IEEE Transactions on Information Forensics and Security
The rise in network attacks has made robust malicious traffic detection crucial. However, the dynamic nature of network traffic causes concept drift, undermining the efficacy of traditional detection methods, which often rely on a static i.i.d data environment and struggle to adapt to new patterns. To overcome these limitations, we propose Argus, a novel framework for malicious traffic detection that operates in a comprehensive, automated, and adaptive manner. Argus tackles three core challenges: accurately classifying known traffic while detecting drift, automatically identifying malicious drifting traffic, and maintaining performance through continuous updates. To address these challenges, Argus integrates a contrastive learningbased module to produce compact representations of traffic and implements a fine-grained drift detection method using category-specific reconstruction loss distributions. For drifting traffic, Argus uses clustering-based automated identification to detect attacks without human intervention. Furthermore, a distance-constrained update mechanism ensures smooth model adaptation, preserving stability and accuracy. Extensive experiments demonstrate that Argus achieves superior performance, with an average F1 score exceeding 95% under various conditions and retaining robust performance even under extreme drift scenarios.