Rust

Rust에 대해 3개 실제 데이터 소스에서 26개 공개 신호를 찾았습니다. GitHub 10건, Hacker News 6건, arXiv 10건을 원문 링크와 함께 보여줍니다.

검색 결과 보기

토픽 정보

이름
Rust
Slug
rust
관련 키워드
and, rust, the, for, that, code, language, with
최근 7일 변화
MVP에서는 실시간 검색 결과 기반 점수만 계산합니다. DB snapshot 저장 후 추세가 표시됩니다.
마지막 업데이트
2026-07-25T09:46:36.443Z

출처별 최신 반응

Show HN: Open-weight OCR got so cheap I had to share it

This was not supposed to become a product. When PaddleOCR-VL-1.6 dropped, independent benchmarks put it at the top of document parsing models. I had to try it. I needed a provider, but there simply isn't one ready...

hackernews · 원본 ID 49041317

From Resource Flow to Executable Tests: Petri-Net-Guided LLM Test Generation for Concurrent Stateful Rust APIs

Concurrent stateful library APIs expose behavior through evolving resource ownership, lifecycle states, and competing interleavings. Large language models can synthesize executable Rust tests, but their outputs often violate API preconditions, remain shallow, or reduce concurrency to accidental sequential traces. Conversely, model-based and systematic testing techniques provide semantic control but commonly require substantial handwritten code to turn abstract scenarios into executable tests. This paper addresses...

arxiv · 원본 ID http://arxiv.org/abs/2607.21530v1

What, Where, and How: Disentangling the Roles of Task, Language, and Model in Code Model Representations

Do independently trained language models come to represent the same thing in the same way? We answer for code, extending a recently introduced concept-circuit extraction method to a 2x2 design -- Python and Rust crossed with Qwen2.5-Coder-7B and DeepSeek-Coder-V1-6.7B -- and measuring a complete inventory of grammatical concepts (58 Python, 57 Rust) identically in all four cells: the smallest design that separates what depends on the task, the language, and the model. The answer splits into three parts. What earns...

arxiv · 원본 ID http://arxiv.org/abs/2607.21491v1

STLSat---An Improved Tableau for Satisfiability Checking of Signal Temporal Logic Formulas

Signal Temporal Logic (STL) is a formalism used to describe temporal properties of real-valued signals in cyber-physical systems. In mission- and safety-critical domains, specifications often consist of large collections of STL formulas, making consistency checking and requirement analysis a major engineering bottleneck. Despite tableau-based satisfiability procedures being a natural solution to solve this problem, we have recently found out that the only existing tree-shaped tableau for bounded discrete-time STL...

arxiv · 원본 ID http://arxiv.org/abs/2607.21081v1

Multi-Source and Cross-Scenario Strategy-Guided Code Optimization

Automated code optimization improves program performance by refactoring source code, and recent studies use LLMs to generate optimization patches. The newest approaches are strategy-guided: they summarize strategies from historical optimization commits as static analysis rules, and use these rules to match code locations for LLMs to optimize. However, these approaches have two limitations: (1) the strategies may come from other knowledge sources, such as textbooks and web pages, but the existing approaches cannot...

arxiv · 원본 ID http://arxiv.org/abs/2607.20353v1

Towards Reliable C-to-Rust Translation with Rule-Guided Reasoning and Reinforcement Learning

The migration of legacy C programs to Rust has become an important direction for improving software memory safety while alleviating the high cost of manual rewriting. Leveraging large language models (LLMs) for automated C-to-Rust translation has emerged as a promising direction. However, existing LLM-based approaches remain limited. On the one hand, LLMs exhibit limited capability in identifying Rust-specific rules, and inadequate handling of Rust syntax often results in incorrect translations. On the other hand,...

arxiv · 원본 ID http://arxiv.org/abs/2607.19966v1

Towards Automated Formal Verification of zkEVMs Using LLM-Guided Constraint Synthesis

Zero-Knowledge Ethereum Virtual Machines (zkEVMs) secure Ethereum rollups by generating zero-knowledge proofs that guarantee off-chain execution correctness. However, subtle implementation bugs (e.g., incorrect gas accounting) can lead to valid proofs certifying semantically faulty states, thereby silently defeating cryptographic guarantees. Formal verification via SMT solvers can prevent this, but is bottlenecked by specification: current zkEVM development practice lacks automated methods to translate Rust opcode...

arxiv · 원본 ID http://arxiv.org/abs/2607.19795v1

Bloomy (YC S26) is hiring a founding engineer

About Bloomy Bloomy is an AI tutor and curriculum for K-12 students. Our student users are learning approximately 2x faster in early pilots, and students and teachers alike love our product. How it works: We diagnose st...

hackernews · 원본 ID 48995037