Reproduce “A Modular Program-Transformation Framework for Reducing Specifications to Reachability” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Dirk Beyer, Marek Jankola, Marian Lingsch-Rosenfeld, Tian Xia, Xiyue Zheng
Researchers at LMU Munich developed TransVer, a modular program-transformation framework that reduces diverse software specifications to reachability problems by instrumenting C programs. This framework enables existing reachability-focused verifiers to support properties like no-overflow, termination, and memory cleanup, often matching or outperforming specialized native verification tools and improving proof and alarm counts on SV-COMP benchmarks.
Key insights
- It is possible to construct software verifiers modularly by composing 'off-the-shelf' transformations with existing reachability verifiers.
- Transformation-based approaches, even when external and applied to source code, can be as efficient or more efficient than tools with native, specialized support for a given specification.
- The Instrumentation Automata approach is general enough to reduce both practical safety properties (no-overflow, memory cleanup) and complex liveness properties (termination, general explicit liveness) to reachability.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.