Hacktoberfest 2026: le issue che i maintainer hanno segnato per ottobre, aperte e adatte ai principianti. Sfoglia le issue Hacktoberfest

[Calls] Reconstruct bounded recursive and executable object state without flattening it

Aperta
#495 0 commenti 0 reazioni 0 assegnatari Vedi su GitHub

I maintainer di solito rispondono entro 1 giorno

Nessuno ha ancora preso questa issue.

Valutazione

Difficoltà
5/5
Tempo stimato
Più di una settimana
Idoneità per principianti
8/100
Tipo di issue
Funzionalità
Chiarezza
Da chiarire
Stato di attività
Attiva
Stack tecnologico
java, javascript, kotlin
Ambito
devtools

Direzione di ricerca

This is design work spanning the class/domain transport, generators and native/symbolic state observation, with explicit dependencies on USVM #298, #467 and #462. Start by reading the frozen v7 ledger and V7_INFRASTRUCTURE_FRONTIER.md referenced in the issue, not by changing code. Done would mean a coordinated design for a bounded object-graph contract, agreed with the owners of the linked issues.

Scritto dal modello di indicizzazione a partire dal testo della issue.

Descrizione

Part of https://github.com/UnitTestBot/usvm/issues/483.

Observed boundary

Priority: P2. confirmed follow-on/engine-suited domain gaps; not an extra count among the 197 first rejections.

These examples belong to the separately selected side corpus; they must not be added to original first-gate counts.

Implementation scope

Extend the existing class/domain transport in independently reviewable slices: bounded recursive object graphs with aliases/cycles and prototypes; then source-attested callable/accessor-backed state where needed by real classes. Align generators, symbolic heap projection, input extraction and native/symbolic state observations. Observe descriptors without accidentally executing accessors; callable inputs/storage reuse their owning engine issues.

Acceptance criteria

  • Graph, SinglyLinkedList and DoublyLinkedList have a bounded graph contract preserving node identity, aliases, cycles and source-proven constructors.
  • SubstringIndex/MxCache state is represented or precisely classified without removing callable/accessor fields such as clear.
  • Original and instrumented native executions preserve mutation and observation order; unsupported executable shapes remain explicit.
  • Reuse USVM #298/#467 for callable storage and #462 for callable input synthesis. No parallel generic serialization/model framework or arbitrary closure snapshot claim.

Existing work to reuse or coordinate

Evidence and delivery rules

Use the frozen v7 200-class ledger and the source-linked reproducer; do not overwrite sealed experiment output. Reuse existing loaders, domain projection, source instrumentation, candidate/replay contracts and bounded observations. Keep original class members and independently frozen domain policies. Run focused source/native checks for the changed contract and leave broad suites to CI; unsupported and newly exposed later gates remain recorded.

Local evidence: iccq2026-paper/experiments/class-coverage-round-robin-20261002/real-class-campaign-20261014/{original/selection-ledger-v7.json,V7_INFRASTRUCTURE_FRONTIER.md} and real-class-machine-diagnostic-20261014/revised-protocol-v8/README.md.

Lingua principale
Kotlin
Stelle
33
Fork
27
Merge medio
3g 21h
PR unite (30g)
88

Preparare l'ambiente

Questo progetto non fornisce container di sviluppo, Dockerfile né guida per i contributori, quindi l'ambiente è a tuo carico: parti dal suo README e consulta la nostra guida al primo contributo per i passaggi generali.

Come iniziare

  1. Leggi tutta la issue e poi la guida ai contributi del progetto.
  2. Commenta sulla issue per dire che te ne occupi tu — evita che due persone facciano lo stesso lavoro.
  3. Fai un fork del repository e lavora su un branch.
  4. Apri una pull request che faccia riferimento al numero della issue.

Altre issue di UnitTestBot/usvm

Tutte le issue di UnitTestBot/usvm

Issue simili

Altre issue su Kotlin

Ricevi le nuove issue nella tua casella

Un breve riepilogo di issue GitHub adatte ai principianti.