Symetra: Visual Analytics for the Parameter Tuning Process of Symbolic Execution Engines

• URL: http://arxiv.org/abs/2604.05349v1
• Date: Tue, 07 Apr 2026 02:42:28 GMT
• Title: Symetra: Visual Analytics for the Parameter Tuning Process of Symbolic Execution Engines
• Abstract summary: Symbolic execution engines such as KLEE automatically generate test cases to maximize branch coverage.<n>Their numerous parameters make it difficult to understand the parameters' impact, leading the user to rely on suboptimal default configurations.<n>We present a visual analytics system, Symetra, designed to support Human-in-the-Loop parameter tuning.
• Score: 4.808210832109656
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Symbolic execution engines such as KLEE automatically generate test cases to maximize branch coverage, but their numerous parameters make it difficult to understand the parameters' impact, leading the user to rely on suboptimal default configurations. While automated tuners have shown promising results, they provide limited insights into why certain configurations work well, motivating the need for Human-in-the-Loop approaches. In this work, we present a visual analytics system, Symetra, designed to support Human-in-the-Loop parameter tuning of symbolic execution engines. To handle a large number of parameters and their configurations, we provide two complementary overviews of their impact on branch coverage values and patterns. Building on these overviews, our system enables collective analysis, allowing the user to contrast groups of configurations and identify differences that may affect branch coverage. We also report on case studies and a Human-in-the-Loop tuning process, demonstrating that experts not only interpreted parameter impacts and identified complementary configurations, but also improved upon fully automated approaches in both branch coverage and tuning efficiency.

Related papers

• Which Hyperparameters Matter? A Game-Theoretic Framework for Interpretable Hyperparameter Sensitivity Analysis [0.0]
  This work presents a game-theoretic framework for interpretable hyperparameter-objective interaction analysis.<n>The proposed framework provides interpretable insights into objective-aware hyperparameter interactions, enabling practitioners to guide subsequent optimization and reduce the search space.<n>The effectiveness of the proposed framework is demonstrated using three distinct neural network architectures across different problem domains under multi-objective settings.
  arXiv  Detail & Related papers  (2026-07-17T11:58:35Z)
• TO-Agents: A Multi-Agent AI Pipeline for Preference-Guided Topology Optimization [6.670146926866281]
  We present TO-Agents, a multi-agent AI framework that connects natural-language design intent with iterative topology optimization.<n>The framework converts a human-provided problem description into validated solver inputs, runs a topology optimization solver, and renders the resulting 3D topology.<n>We evaluate the framework on two long-horizon design tasks: a cantilever beam benchmark and a phone-stand product design.
  arXiv  Detail & Related papers  (2026-05-20T18:32:56Z)
• Relation-Aware Bayesian Optimization of DBMS Configurations Guided by Affinity Scores [2.474203056060563]
  Database Management Systems (DBMSs) are fundamental for managing large-scale and heterogeneous data, and their performance is critically influenced by configuration parameters.<n>Recent research has focused on automated configuration optimization using machine learning; however, existing approaches still exhibit several key limitations.<n>We propose RelTune, a novel framework that represents parameter dependencies as a Graph and learns GNN-based latent embeddings that encode performancerelevant semantics.
  arXiv  Detail & Related papers  (2025-10-31T03:46:42Z)
• Continual Adaptation: Environment-Conditional Parameter Generation for Object Detection in Dynamic Scenarios [54.58186816693791]
  environments constantly change over time and space, posing significant challenges for object detectors trained based on a closed-set assumption.<n>We propose a new mechanism, converting the fine-tuning process to a specific- parameter generation.<n>In particular, we first design a dual-path LoRA-based domain-aware adapter that disentangles features into domain-invariant and domain-specific components.
  arXiv  Detail & Related papers  (2025-06-30T17:14:12Z)
• Token-Level Prompt Mixture with Parameter-Free Routing for Federated Domain Generalization [51.562474873972086]
  Federated domain generalization (FedDG) aims to learn a globally generalizable model from decentralized clients with heterogeneous data.<n>Recent studies have introduced prompt learning to adapt vision-language models (VLMs) in FedDG by learning a single global prompt.<n>We propose TRIP, a Token-level prompt mixture with parameter-free routing framework for FedDG.
  arXiv  Detail & Related papers  (2025-04-29T11:06:03Z)
• Efficient Multi-Instance Generation with Janus-Pro-Dirven Prompt Parsing [53.295515505026096]
  Janus-Pro-driven Prompt Parsing is a prompt- parsing module that bridges text understanding and layout generation.<n>MIGLoRA is a parameter-efficient plug-in integrating Low-Rank Adaptation into UNet (SD1.5) and DiT (SD3) backbones.<n>The proposed method achieves state-of-the-art performance on COCO and LVIS benchmarks while maintaining parameter efficiency.
  arXiv  Detail & Related papers  (2025-03-27T00:59:14Z)
• Controllable Prompt Tuning For Balancing Group Distributional Robustness [53.336515056479705]
  We introduce an optimization scheme to achieve good performance across groups and find a good solution for all without severely sacrificing performance on any of them. We propose Controllable Prompt Tuning (CPT), which couples our approach with prompt-tuning techniques. On spurious correlation benchmarks, our procedures achieve state-of-the-art results across both transformer and non-transformer architectures, as well as unimodal and multimodal data.
  arXiv  Detail & Related papers  (2024-03-05T06:23:55Z)
• Benchmarking the Operation of Quantum Heuristics and Ising Machines: Scoring Parameter Setting Strategies on Optimization Applications [14.554670718138398]
  We discuss guidelines for evaluating the performance of parameterized solvers for optimization problems. We discuss the necessity and cost of setting parameters that affect the algorithm's performance. We present an open-source software package that facilitates the design, evaluation, and visualization of practical parameter tuning strategies.
  arXiv  Detail & Related papers  (2024-02-15T16:58:33Z)
• A Dynamic Feature Interaction Framework for Multi-task Visual Perception [100.98434079696268]
  We devise an efficient unified framework to solve multiple common perception tasks. These tasks include instance segmentation, semantic segmentation, monocular 3D detection, and depth estimation. Our proposed framework, termed D2BNet, demonstrates a unique approach to parameter-efficient predictions for multi-task perception.
  arXiv  Detail & Related papers  (2023-06-08T09:24:46Z)
• Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performance [4.629694186457132]
  Tree-structured Parzen estimator (TPE) is a widely used Bayesian optimization method in recent parameter tuning frameworks such as Hyperopt and Optuna.<n>Despite its popularity, the roles of each control parameter in TPE and the algorithm intuition have not been discussed so far.<n>This paper identifies the roles of each control parameter and their impacts on parameter tuning based on the ablation studies using diverse benchmark datasets.
  arXiv  Detail & Related papers  (2023-04-21T17:02:38Z)
• Revisiting the Evaluation of Image Synthesis with GANs [55.72247435112475]
  This study presents an empirical investigation into the evaluation of synthesis performance, with generative adversarial networks (GANs) as a representative of generative models. In particular, we make in-depth analyses of various factors, including how to represent a data point in the representation space, how to calculate a fair distance using selected samples, and how many instances to use from each set.
  arXiv  Detail & Related papers  (2023-04-04T17:54:32Z)
• Parameter-Efficient Fine-Tuning Design Spaces [63.954953653386106]
  We present a parameter-efficient fine-tuning design paradigm and discover design patterns that are applicable to different experimental settings. We show experimentally that these methods consistently and significantly outperform investigated parameter-efficient fine-tuning strategies across different backbone models and different tasks in natural language processing.
  arXiv  Detail & Related papers  (2023-01-04T21:00:18Z)
• Visualization and Optimization Techniques for High Dimensional Parameter Spaces [4.111899441919165]
  We propose a novel approach to create an auto-tuning framework for storage systems optimization combining both direct optimization techniques and visual analytics research. Our system was developed in tight collaboration with a group of systems performance researchers and its final effectiveness was evaluated with expert interviews, a comparative user study, and two case studies.
  arXiv  Detail & Related papers  (2022-04-28T23:01:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.