General-purpose coding agents achieve highest success on SciVis tasks but cost more compute, while domain-specific agents are efficient yet less flexible and computer-use agents falter on long workflows.
In: Pro- ceedings of the SC ’25 Workshops of the International Conference for High Perfor- mance Computing, Networking, Storage and Analysis
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
CoVer extended to Fortran preserves analysis accuracy, reveals a bug in MPI-BugBench, and runs substantially faster than MUST while supporting multiple languages.
citing papers explorer
-
Exploring Interaction Paradigms for LLM Agents in Scientific Visualization
General-purpose coding agents achieve highest success on SciVis tasks but cost more compute, while domain-specific agents are efficient yet less flexible and computer-use agents falter on long workflows.
-
Extending Contract Verification for Parallel Programming Models to Fortran
CoVer extended to Fortran preserves analysis accuracy, reveals a bug in MPI-BugBench, and runs substantially faster than MUST while supporting multiple languages.