ISP RAS — SharpChecker development
- Work on symbolic computation in SharpChecker, a C#/.NET static-analysis tool.
I design and build software systems, from compilers and program-analysis tools to backend services and offline-first applications. I work on symbolic computation in SharpChecker at ISP RAS and previously implemented LLVM optimization at MCST. In independent projects, I own architecture, implementation, and correctness checks.
Resolved component dependencies, conflicts, and backend routes into an immutable LanguagePlan; runtime materializes the checked selection without replanning.
Frontend, IR, optimization passes, interpreter and CIL backend; independent configuration checks and 1,324 tests at the 9 Oct 2026 revision.
Built a web/Android planner separating external observations and user state from derived plans; feasible schedules require a validated witness.
Offline operations replay idempotently; the signed Android 0.8.3 release workflow passed on 10 Oct 2026.
Built backend logic for payments and subscriptions, preserving provider evidence independently of access changes.
Idempotent retries, reconciliation and manual review for conflicts, with backup/restore and rollback safeguards; no scale claim.
C++ · C#/.NET · Python · software and systems engineering
Software Engineer — Systems & Architecture
I design and build software systems, from compilers and program-analysis tools to backend services and offline-first applications. I work on symbolic computation in SharpChecker at ISP RAS and previously implemented LLVM optimization at MCST. In independent projects, I own architecture, implementation, and correctness checks.
01 · Experience
Roles are described through ownership boundaries and verifiable outcomes.
C#/.NET · static analysis · symbolic computation
LLVM 22 · C++23 · compiler engineering
02 · Projects
Each case presents the original problem, the chosen design, and a verifiable outcome.
Frontend, semantic components, IR/optimization passes, and execution backends should evolve independently while composing into one deterministic toolchain without hidden registration-order dependencies.
Problem: Imported evidence, local edits, and LLM proposals can conflict; disconnected clients must not lose or silently overwrite user intent.
Solution: Separated external observations, canonical state, and derived plans; client operation IDs and atomic server records make offline replay idempotent. Feasibility requires validated witnesses and preserves UNKNOWN where proof is missing.
Result: Browser and native Android clients, migrations and device/release checks; the signed Android 0.8.3 release workflow passed on 10 Oct 2026. External adoption has not been established.
Problem: Payment, subscription, and actual access can diverge after duplicate webhooks, timeouts, or process restarts.
Solution: Explicit access and payment states, idempotent operations, audit trails, background reconciliation, migrations, and verifiable recovery paths.
Result: Verifiable state transitions, backup/restore, health gates, and rollback-aware deployment; the public case study excludes secrets and user data.
03 · Skills
C++23, C#/.NET, Python; also Rust, Java, JavaScript, SQL
modular architecture, compiler tooling, APIs, Linux, SQLite/PostgreSQL
offline synchronization, Android, payments, state recovery, migrations
regression and differential tests, LLVM Verifier, invariants, idempotency
04 · Recognition
Organizer correspondence: only 5.0/5.0 score and only solution passing all 104/104 tests among 49 submissions.
Delivered the UniversalToolchain architecture talk at LangDev on 9 October 2026.
Selected as one of the winners with UniversalToolchain / Wist2.
MEPhI Junior: Information Technologies section winner in 2025 and first-degree diploma in 2026; HSE Vysshaya Proba Industrial Programming diploma holder; Baltic Science and Engineering Competition: first-degree diploma and the “Perfection as Hope” prize.
05 · Education
Moscow