Institution profile

VMware, Inc.

Industry researchnorthamerica · us
Official website
Research library12linked papers
Opportunities0open roles
Selected work

Representative Papers

TORQUE: Optimizing What (not) to Quantize Before and After Rotation

Sep 28, 2026

This study addresses the optimization of high-precision coordinate retention strategies in rotation-based quantization. We propose a method that jointly optimizes the number and positions of retained coordinates before and after rotation to minimize quantization error under a fixed bit budget. Theoretically, we prove that retaining the top-k coordinates prior to rotation minimizes the upper bound of the quantization error, thereby reducing a complex combinatorial search to the optimization of a scalar k, for which a fast parallel selection algorithm is designed. Combined with random rotation preprocessing and offline codebook optimization, our approach achieves efficient compression. Experiments demonstrate that the proposed method significantly improves the trade-off between reconstruction accuracy and storage efficiency across Gaussian modeling, nearest neighbor retrieval, KV cache compression, and activation quantization tasks.

0 citationsRead paper

An AI Approach to Verified Production Cryptographic Libraries

Aug 01, 2026

This work addresses the challenges of scale and complexity in formally verifying production-grade cryptographic libraries, where existing approaches fall short of end-to-end automation. We present CryptoProver, a system that achieves, for the first time, fully automated verification of real-world cryptographic implementations such as curve25519-dalek and RustCrypto’s chacha20. CryptoProver integrates large language models with the Verus verifier to automatically synthesize internal specifications and verifiable proofs from high-level API contracts, without requiring source code modifications. By leveraging a pre-defined trusted library, mechanical gating, and isolation mechanisms, the system ensures specification strength and cross-module consistency. In experiments, CryptoProver completed verification within 11.4 hours at an API cost of \$466.99, successfully covering core cryptographic components relied upon by widely deployed systems including Signal (with 218 million downloads) and Shadowsocks.

0 citationsRead paper

SpotIt+: Verification-based Text-to-SQL Evaluation with Database Constraints

Mar 04, 2026

This work addresses the limitations of existing Text-to-SQL evaluation methods, which often fail to capture semantic discrepancies between generated and reference SQL queries, particularly in the absence of real database constraints. To overcome this, the authors propose a bounded equivalence verification framework that actively searches for database instances capable of distinguishing the semantics of two queries. The core innovation lies in integrating rule-driven constraint mining with large language model–based validation, ensuring that the generated counterexamples are both semantically discriminative and realistic in practical deployment scenarios. Experiments on the BIRD dataset demonstrate that the proposed approach efficiently uncovers numerous semantic errors missed by conventional evaluation metrics, thereby substantially enhancing the validity and fidelity of Text-to-SQL system assessment.

0 citationsRead paper
Recent publications

Latest Papers

TORQUE: Optimizing What (not) to Quantize Before and After Rotation

Sep 28, 2026

This study addresses the optimization of high-precision coordinate retention strategies in rotation-based quantization. We propose a method that jointly optimizes the number and positions of retained coordinates before and after rotation to minimize quantization error under a fixed bit budget. Theoretically, we prove that retaining the top-k coordinates prior to rotation minimizes the upper bound of the quantization error, thereby reducing a complex combinatorial search to the optimization of a scalar k, for which a fast parallel selection algorithm is designed. Combined with random rotation preprocessing and offline codebook optimization, our approach achieves efficient compression. Experiments demonstrate that the proposed method significantly improves the trade-off between reconstruction accuracy and storage efficiency across Gaussian modeling, nearest neighbor retrieval, KV cache compression, and activation quantization tasks.

0 citationsRead paper

An AI Approach to Verified Production Cryptographic Libraries

Aug 01, 2026

This work addresses the challenges of scale and complexity in formally verifying production-grade cryptographic libraries, where existing approaches fall short of end-to-end automation. We present CryptoProver, a system that achieves, for the first time, fully automated verification of real-world cryptographic implementations such as curve25519-dalek and RustCrypto’s chacha20. CryptoProver integrates large language models with the Verus verifier to automatically synthesize internal specifications and verifiable proofs from high-level API contracts, without requiring source code modifications. By leveraging a pre-defined trusted library, mechanical gating, and isolation mechanisms, the system ensures specification strength and cross-module consistency. In experiments, CryptoProver completed verification within 11.4 hours at an API cost of \$466.99, successfully covering core cryptographic components relied upon by widely deployed systems including Signal (with 218 million downloads) and Shadowsocks.

0 citationsRead paper

SpotIt+: Verification-based Text-to-SQL Evaluation with Database Constraints

Mar 04, 2026

This work addresses the limitations of existing Text-to-SQL evaluation methods, which often fail to capture semantic discrepancies between generated and reference SQL queries, particularly in the absence of real database constraints. To overcome this, the authors propose a bounded equivalence verification framework that actively searches for database instances capable of distinguishing the semantics of two queries. The core innovation lies in integrating rule-driven constraint mining with large language model–based validation, ensuring that the generated counterexamples are both semantically discriminative and realistic in practical deployment scenarios. Experiments on the BIRD dataset demonstrate that the proposed approach efficiently uncovers numerous semantic errors missed by conventional evaluation metrics, thereby substantially enhancing the validity and fidelity of Text-to-SQL system assessment.

0 citationsRead paper