Search arXivSearch

arXiv · 2602.05458

Emergence-as-Code as a Foundation for Self-Governing Reliable Systems

Abstract

Service-level objective (SLO)-as-code tools make per-service reliability declarative, but users experience journeys: end-to-end executions whose availability and tail latency emerge from topology, routing, redundancy, timeouts/fallbacks, shared failure domains, and tail amplification. Journey objectives are therefore often maintained outside code and drift away from the effective runtime graph. We propose Emergence-as-Code (EmaC), a declarative contract that compiles journey-level SLI bounds and governance artifacts for declared SLOs from intent and evidence. An EmaC specification defines a typed journey expression, leaf bindings to atomic SLOs and telemetry, failure-domain assumptions, and guarded actions. Model Discovery proposes evidence-backed deltas for edges, branch probabilities, redundancy groups, and failure-domain hypotheses; each delta carries provenance and confidence. The compiler derives optimistic and pessimistic journey bounds and emits reviewable governance artifacts. An executable checkout replay shows that local SLOs can remain green while evidence-backed discovery changes the failure-domain model, collapses the pessimistic payment-race bound, and changes the rollout decision from pass to fail or review.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anatoly A. Krasnovsky. 2026-06-08. Emergence-as-Code as a Foundation for Self-Governing Reliable Systems. https://arxiv.org/abs/2602.05458

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

What is the Difference Between Me and You? Benchmarking the Quality Gap Between Human-Written and AI-Generated Code

AI coding assistants are becoming co-authors of production software, yet their evaluation centers on functional correctness, leaving open whether their code differs from human code in the quality dimensions dominating lifecycle cost. We compare human-written and AI-generated code at scale: 787,562 function pairs across Python, Java, and C, each human function mined from open-source repositories paired with implementations generated from its docstring by three AI assistants (OpenAI GPT models, DeepSeek-Coder, Qwen2.5-Coder). We characterize structural complexity and statistical naturalness, and map static-analysis findings onto Orthogonal Defect Classification for defects and the Common Weakness Enumeration for vulnerabilities, making authors and languages directly comparable. AI-generated code is structurally compressed and stylistically templated: roughly half the size and branching of human code, clustering apart at the style level. Defect profiles differ in kind: human code concentrates issues of mature codebases, AI code repetitive boilerplate; security is language-dependent, with LLMs producing more, and more severe, findings in Python and Java but fewer high-severity memory-safety findings than humans in C. Once size is controlled for, complexity metrics carry little signal, while naturalness separates authors. Finally, we release CQBench, a benchmark of 27,346 issue-prone tasks with baselines and an evaluation pipeline for quality assurance and security testing.

cs.SE

A Carbon-Aware Quantum Computing Framework for LCA-Driven Sustainability in Quantum Cloud Services

Quantum computing's environmental footprint remains poorly understood relative to classical infrastructure, and as quantum computing moves toward cloud delivery, Quantum Cloud Service (QCS) providers lack actionable guidance beyond platform-level carbon-accounting frameworks. Objective: This study extends the carbon-aware quantum computing (CQC) framework from a platform-level to a service-level model that translates empirical life cycle assessment (LCA) findings of a superconducting quantum computer into guidance for QCS providers. Method: We modeled the CQC framework via service-level embodied-carbon allocation, load-independent and load-proportional operational decomposition, and a workload-resolved application offset on the basis of results acquired through a cradle-to-grave LCA of a superconducting quantum platform. Results: The five-year footprint is 583 t CO2e (GKP) and 10,570 t (surface-code), dominated by embodied carbon (77.3-85.2%), with operational-embodied parity not reached until 17.0-28.7 years versus 2.7 years for classical comparators. This reorders provider levers: utilisation yields the largest gain (19.7x), followed by service life extension (59.9%) and electricity supply (6.5x), while operational efficiency and renewable procurement offer limited leverage. Conclusion: Superconducting quantum computers are structurally embodied-carbon-dominated, inverting classical sustainability intuition and motivating direct power measurement and cross-architecture validation as quantum infrastructure scales.

cs.SE

Fault-Class-Matched Test Oracles for Output-Invisible Quantum Transpiler Regressions

Test oracles for quantum transpilers typically judge correctness by comparing compiled output against a reference: a statevector, a sampled distribution, or a unitary compared modulo global phase. A companion empirical study measures how often that choice fails. Roughly 28% of merged Qiskit transpiler bug-fixes (95% Wilson CI 19-40%) repair a fault that corrupts layout metadata, global phase, or run-to-run reproducibility while output stays correct: invisible to a black-box output-equivalence oracle by construction. This paper closes that gap with a fault-class-matched, layout-aware, width-tiered oracle family: a layout/permutation contract checker and a contract-level metamorphic relation (MR-1) for the metadata channel, a global-phase tracker for the phase channel, and a determinism runner for reproducibility. Verified from source on nine real, merged Qiskit transpiler regressions (three per channel), the output-equivalence oracle is blind throughout and the matched mechanism fires on every case. A 675-configuration sweep of the contract/metadata invariant finds no false positive. Synthetic mutant families confirm reliability at scale: 1.00 sensitivity and specificity across 36 mutants apiece for the contract/metadata and global-phase channels, and 1.00 sensitivity (95% CI 0.44-1.00) for reproducibility on the three circuits where the mutation is constructible. The contract checker costs two to six orders of magnitude less than a plain output check, the global-phase tracker is comparably cheap within its exact tier, and only the metamorphic relation carries a bounded cost. Ported natively to pytket/tket, the global-phase mechanism transfers cleanly, an identical 1.00/1.00 result with phases recovered to double-precision accuracy, evidence against a Qiskit-specific artifact.

cs.SE