@stevenvo780/st-lang 4.12.0 → 4.14.0

package/dist/tests/reasoning/galois-fields/galois-fields.test.js

@@ -0,0 +1,226 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const galois_fields_1 = require("../../../reasoning/galois-fields");
+// Helpers ----------------------------------------------------
+function enumerateElements(F) {
+    const out = [];
+    for (let k = 0; k < F.order; k++) {
+        const coeffs = Array.from({ length: F.degree }, () => 0);
+        let x = k;
+        for (let i = 0; i < F.degree; i++) {
+            coeffs[i] = x % F.prime;
+            x = Math.floor(x / F.prime);
+        }
+        out.push((0, galois_fields_1.gfElement)(F, coeffs));
+    }
+    return out;
+}
+(0, vitest_1.describe)('Galois Fields — irreducibles', () => {
+    (0, vitest_1.it)('findIrreducibleOverZp(2, 1) devuelve x', () => {
+        (0, vitest_1.expect)((0, galois_fields_1.findIrreducibleOverZp)(2, 1)).toEqual([0, 1]);
+    });
+    (0, vitest_1.it)('findIrreducibleOverZp(2, 3) devuelve un polinomio de grado 3 mónico', () => {
+        const f = (0, galois_fields_1.findIrreducibleOverZp)(2, 3);
+        (0, vitest_1.expect)(f).not.toBeNull();
+        (0, vitest_1.expect)(f && f[f.length - 1]).toBe(1);
+        (0, vitest_1.expect)(f && f.length).toBe(4);
+    });
+    (0, vitest_1.it)('findIrreducibleOverZp(3, 2) existe y es de grado 2', () => {
+        const f = (0, galois_fields_1.findIrreducibleOverZp)(3, 2);
+        (0, vitest_1.expect)(f).not.toBeNull();
+        (0, vitest_1.expect)(f && f.length).toBe(3);
+    });
+    (0, vitest_1.it)('rechaza p no primo', () => {
+        (0, vitest_1.expect)(() => (0, galois_fields_1.findIrreducibleOverZp)(4, 2)).toThrow();
+    });
+});
+(0, vitest_1.describe)('Galois Fields — GF(p)', () => {
+    (0, vitest_1.it)('GF(2): suma equivale a XOR', () => {
+        const F = (0, galois_fields_1.makeGaloisField)(2, 1);
+        const zero = (0, galois_fields_1.gfZero)(F);
+        const one = (0, galois_fields_1.gfOne)(F);
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfAdd)(F, one, one), zero)).toBe(true);
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfAdd)(F, one, zero), one)).toBe(true);
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfAdd)(F, zero, zero), zero)).toBe(true);
+    });
+    (0, vitest_1.it)('GF(2): multiplicación equivale a AND', () => {
+        const F = (0, galois_fields_1.makeGaloisField)(2, 1);
+        const zero = (0, galois_fields_1.gfZero)(F);
+        const one = (0, galois_fields_1.gfOne)(F);
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, one, one), one)).toBe(true);
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, one, zero), zero)).toBe(true);
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, zero, zero), zero)).toBe(true);
+    });
+    (0, vitest_1.it)('GF(7): inverso de cada no-cero da 1', () => {
+        const F = (0, galois_fields_1.makeGaloisField)(7, 1);
+        for (let k = 1; k < 7; k++) {
+            const a = (0, galois_fields_1.gfElement)(F, [k]);
+            const inv = (0, galois_fields_1.gfInverse)(F, a);
+            (0, vitest_1.expect)(inv).not.toBeNull();
+            if (inv)
+                (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, a, inv), (0, galois_fields_1.gfOne)(F))).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('GF(7) tiene primitivo y su orden es 6', () => {
+        const F = (0, galois_fields_1.makeGaloisField)(7, 1);
+        const g = (0, galois_fields_1.findPrimitive)(F);
+        (0, vitest_1.expect)((0, galois_fields_1.order)(F, g)).toBe(6);
+    });
+});
+(0, vitest_1.describe)('Galois Fields — GF(2^3)', () => {
+    const F = (0, galois_fields_1.makeGaloisField)(2, 3);
+    (0, vitest_1.it)('orden del cuerpo = 8', () => {
+        (0, vitest_1.expect)(F.order).toBe(8);
+    });
+    (0, vitest_1.it)('todo no-cero tiene inverso y a · a^-1 = 1', () => {
+        const elements = enumerateElements(F);
+        const one = (0, galois_fields_1.gfOne)(F);
+        for (const a of elements) {
+            if ((0, galois_fields_1.gfEq)(a, (0, galois_fields_1.gfZero)(F)))
+                continue;
+            const inv = (0, galois_fields_1.gfInverse)(F, a);
+            (0, vitest_1.expect)(inv).not.toBeNull();
+            if (inv)
+                (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, a, inv), one)).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('Fermat little: a^(p^n - 1) = 1 para todo no-cero', () => {
+        const exp = BigInt(F.order - 1);
+        const one = (0, galois_fields_1.gfOne)(F);
+        for (const a of enumerateElements(F)) {
+            if ((0, galois_fields_1.gfEq)(a, (0, galois_fields_1.gfZero)(F)))
+                continue;
+            (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfPow)(F, a, exp), one)).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('existe primitivo y su orden divide a p^n − 1', () => {
+        const g = (0, galois_fields_1.findPrimitive)(F);
+        const ord = (0, galois_fields_1.order)(F, g);
+        (0, vitest_1.expect)(ord).toBe(F.order - 1);
+        (0, vitest_1.expect)((F.order - 1) % ord).toBe(0);
+    });
+});
+(0, vitest_1.describe)('Galois Fields — GF(2^4)', () => {
+    const F = (0, galois_fields_1.makeGaloisField)(2, 4);
+    (0, vitest_1.it)('orden = 16 y existe primitivo de orden 15', () => {
+        (0, vitest_1.expect)(F.order).toBe(16);
+        const g = (0, galois_fields_1.findPrimitive)(F);
+        (0, vitest_1.expect)((0, galois_fields_1.order)(F, g)).toBe(15);
+    });
+    (0, vitest_1.it)('discreteLog inverso de gfPow', () => {
+        const g = (0, galois_fields_1.findPrimitive)(F);
+        for (let k = 0; k < F.order - 1; k++) {
+            const target = (0, galois_fields_1.gfPow)(F, g, BigInt(k));
+            const log = (0, galois_fields_1.discreteLog)(F, g, target);
+            (0, vitest_1.expect)(log).toBe(k);
+        }
+    });
+    (0, vitest_1.it)('gfDiv consistente con gfMul + inverso', () => {
+        const a = (0, galois_fields_1.gfElement)(F, [1, 1, 0, 1]);
+        const b = (0, galois_fields_1.gfElement)(F, [0, 1, 1, 0]);
+        const q = (0, galois_fields_1.gfDiv)(F, a, b);
+        (0, vitest_1.expect)(q).not.toBeNull();
+        if (q)
+            (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfMul)(F, q, b), a)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Galois Fields — leyes algebraicas (GF(3^2))', () => {
+    const F = (0, galois_fields_1.makeGaloisField)(3, 2);
+    (0, vitest_1.it)('suma asociativa y conmutativa', () => {
+        const elements = enumerateElements(F);
+        // Muestreo: 3 triples (a,b,c) deterministas.
+        const samples = [];
+        for (let i = 0; i < 4; i++) {
+            const a = elements[(i * 3) % elements.length];
+            const b = elements[(i * 5 + 1) % elements.length];
+            const c = elements[(i * 7 + 2) % elements.length];
+            if (a && b && c)
+                samples.push([a, b, c]);
+        }
+        for (const [a, b, c] of samples) {
+            (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfAdd)(F, a, b), (0, galois_fields_1.gfAdd)(F, b, a))).toBe(true);
+            const left = (0, galois_fields_1.gfAdd)(F, (0, galois_fields_1.gfAdd)(F, a, b), c);
+            const right = (0, galois_fields_1.gfAdd)(F, a, (0, galois_fields_1.gfAdd)(F, b, c));
+            (0, vitest_1.expect)((0, galois_fields_1.gfEq)(left, right)).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('multiplicación distributiva sobre la suma', () => {
+        const elements = enumerateElements(F);
+        for (let i = 0; i < 5; i++) {
+            const a = elements[(i * 2) % elements.length];
+            const b = elements[(i * 3 + 1) % elements.length];
+            const c = elements[(i * 5 + 2) % elements.length];
+            if (!a || !b || !c)
+                continue;
+            const left = (0, galois_fields_1.gfMul)(F, a, (0, galois_fields_1.gfAdd)(F, b, c));
+            const right = (0, galois_fields_1.gfAdd)(F, (0, galois_fields_1.gfMul)(F, a, b), (0, galois_fields_1.gfMul)(F, a, c));
+            (0, vitest_1.expect)((0, galois_fields_1.gfEq)(left, right)).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('a − a = 0 y a + (−a) = 0', () => {
+        for (const a of enumerateElements(F)) {
+            (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfSub)(F, a, a), (0, galois_fields_1.gfZero)(F))).toBe(true);
+        }
+    });
+});
+(0, vitest_1.describe)('Galois Fields — Reed-Solomon encoding (GF(2^3))', () => {
+    const F = (0, galois_fields_1.makeGaloisField)(2, 3);
+    (0, vitest_1.it)('rsEncode con mensaje constante c devuelve [c, c, ...]', () => {
+        const c = (0, galois_fields_1.gfElement)(F, [1, 0, 1]);
+        const word = (0, galois_fields_1.rsEncode)(F, [c], 5);
+        (0, vitest_1.expect)(word.length).toBe(5);
+        for (const w of word) {
+            (0, vitest_1.expect)((0, galois_fields_1.gfEq)(w, c)).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('rsEncode evalúa el polinomio en potencias del primitivo', () => {
+        const g = (0, galois_fields_1.findPrimitive)(F);
+        const m0 = (0, galois_fields_1.gfOne)(F);
+        const m1 = (0, galois_fields_1.gfOne)(F);
+        // polinomio P(x) = 1 + x
+        const word = (0, galois_fields_1.rsEncode)(F, [m0, m1], 3);
+        (0, vitest_1.expect)(word.length).toBe(3);
+        // P(1) = 1+1 = 0 en GF(2^k)
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)(word[0], (0, galois_fields_1.gfZero)(F))).toBe(true);
+        // P(g) = 1 + g
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)(word[1], (0, galois_fields_1.gfAdd)(F, (0, galois_fields_1.gfOne)(F), g))).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Galois Fields — errores y bordes', () => {
+    (0, vitest_1.it)('gfInverse(0) = null', () => {
+        const F = (0, galois_fields_1.makeGaloisField)(5, 2);
+        (0, vitest_1.expect)((0, galois_fields_1.gfInverse)(F, (0, galois_fields_1.gfZero)(F))).toBeNull();
+    });
+    (0, vitest_1.it)('gfDiv por 0 devuelve null', () => {
+        const F = (0, galois_fields_1.makeGaloisField)(5, 2);
+        const a = (0, galois_fields_1.gfElement)(F, [1, 2]);
+        (0, vitest_1.expect)((0, galois_fields_1.gfDiv)(F, a, (0, galois_fields_1.gfZero)(F))).toBeNull();
+    });
+    (0, vitest_1.it)('gfPow con exponente 0 da 1', () => {
+        const F = (0, galois_fields_1.makeGaloisField)(3, 2);
+        const a = (0, galois_fields_1.gfElement)(F, [2, 1]);
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfPow)(F, a, 0n), (0, galois_fields_1.gfOne)(F))).toBe(true);
+    });
+    (0, vitest_1.it)('gfPow exponente negativo usa inverso', () => {
+        const F = (0, galois_fields_1.makeGaloisField)(5, 1);
+        const a = (0, galois_fields_1.gfElement)(F, [3]);
+        // 3^(-1) mod 5 = 2
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)((0, galois_fields_1.gfPow)(F, a, -1n), (0, galois_fields_1.gfElement)(F, [2]))).toBe(true);
+    });
+    (0, vitest_1.it)('makeGaloisField rechaza irreducible reducible', () => {
+        // (x^2) sobre Z/2 NO es irreducible.
+        (0, vitest_1.expect)(() => (0, galois_fields_1.makeGaloisField)(2, 2, [0, 0, 1])).toThrow();
+    });
+    (0, vitest_1.it)('makeGaloisField acepta irreducible explícito válido para GF(2^2)', () => {
+        // x^2 + x + 1 sobre Z/2 es irreducible.
+        const F = (0, galois_fields_1.makeGaloisField)(2, 2, [1, 1, 1]);
+        (0, vitest_1.expect)(F.order).toBe(4);
+        // Verificar que (1 + x) * (1 + x) reducido tiene sentido.
+        const a = (0, galois_fields_1.gfElement)(F, [1, 1]);
+        const a2 = (0, galois_fields_1.gfMul)(F, a, a);
+        // (1+x)^2 = 1 + 2x + x^2 = 1 + x^2 ≡ 1 + (x+1) = x (mod x^2+x+1, en Z/2)
+        (0, vitest_1.expect)((0, galois_fields_1.gfEq)(a2, (0, galois_fields_1.gfElement)(F, [0, 1]))).toBe(true);
+    });
+});
+//# sourceMappingURL=galois-fields.test.js.map

package/dist/tests/reasoning/galois-fields/galois-fields.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"galois-fields.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/galois-fields/galois-fields.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,oEAkB0C;AAE1C,+DAA+D;AAE/D,SAAS,iBAAiB,CAAC,CAAqC;IAC9D,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,MAAM,MAAM,GAAa,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACnE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;YACxB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,IAAA,yBAAS,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IACjC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,qCAAqB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,CAAC,GAAG,IAAA,qCAAqB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,IAAA,qCAAqB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,qCAAqB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5B,MAAM,GAAG,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAI,GAAG;gBAAE,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhC,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,IAAA,oBAAI,EAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC;gBAAE,SAAS;YACjC,MAAM,GAAG,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAI,GAAG;gBAAE,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;YACrC,IAAI,IAAA,oBAAI,EAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC;gBAAE,SAAS;YACjC,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhC,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACtC,MAAM,GAAG,GAAG,IAAA,2BAAW,EAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YACtC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC;YAAE,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhC,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACtC,6CAA6C;QAC7C,MAAM,OAAO,GAA6C,EAAE,CAAC;QAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC9C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClD,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;YAChC,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxD,MAAM,IAAI,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC9C,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClD,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,SAAS;YAC7B,MAAM,IAAI,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACvD,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,KAAK,MAAM,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;YACrC,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iDAAiD,EAAE,GAAG,EAAE;IAC/D,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhC,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAA,wBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC;QACpB,yBAAyB;QACzB,MAAM,IAAI,GAAG,IAAA,wBAAQ,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,4BAA4B;QAC5B,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,eAAe;QACf,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,yBAAS,EAAC,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,IAAA,sBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,IAAA,qBAAK,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,mBAAmB;QACnB,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,qCAAqC;QACrC,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,wCAAwC;QACxC,MAAM,CAAC,GAAG,IAAA,+BAAe,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,0DAA0D;QAC1D,MAAM,CAAC,GAAG,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAA,qBAAK,EAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1B,yEAAyE;QACzE,IAAA,eAAM,EAAC,IAAA,oBAAI,EAAC,EAAE,EAAE,IAAA,yBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/hoare-logic/hoare-logic.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=hoare-logic.test.d.ts.map

package/dist/tests/reasoning/hoare-logic/hoare-logic.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hoare-logic.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/hoare-logic/hoare-logic.test.ts"],"names":[],"mappings":""}

package/dist/tests/reasoning/hoare-logic/hoare-logic.test.js

@@ -0,0 +1,340 @@
+"use strict";
+// ============================================================
+// ST Hoare Logic — Tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const hoare_logic_1 = require("../../../reasoning/hoare-logic");
+(0, vitest_1.describe)('hoare-logic — sustitución sintáctica', () => {
+    (0, vitest_1.it)('substitute reemplaza la variable libre objetivo', () => {
+        // (x + 1)[5/x] = 5 + 1
+        const expr = (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(1));
+        const result = (0, hoare_logic_1.substitute)(expr, 'x', (0, hoare_logic_1.num)(5));
+        (0, vitest_1.expect)(result).toEqual((0, hoare_logic_1.binop)('+', (0, hoare_logic_1.num)(5), (0, hoare_logic_1.num)(1)));
+    });
+    (0, vitest_1.it)('substitute no toca constantes ni variables distintas', () => {
+        const expr = (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('y'), (0, hoare_logic_1.num)(7));
+        const result = (0, hoare_logic_1.substitute)(expr, 'x', (0, hoare_logic_1.num)(99));
+        (0, vitest_1.expect)(result).toEqual(expr);
+    });
+    (0, vitest_1.it)('substitute recorre operadores unarios y anidados', () => {
+        // expr: ¬(x < x*2). Sustituyendo x=3 → ¬(3 < 6) = ¬true = false.
+        const expr = (0, hoare_logic_1.not)((0, hoare_logic_1.binop)('<', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.binop)('*', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(2))));
+        const result = (0, hoare_logic_1.substitute)(expr, 'x', (0, hoare_logic_1.num)(3));
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)(result, {})).toBe(false);
+        // Y con x=-1: -1 < -2 es false → ¬false = true.
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)(expr, { x: -1 })).toBe(true);
+    });
+});
+(0, vitest_1.describe)('hoare-logic — wp para statements básicos', () => {
+    (0, vitest_1.it)('wp(skip, Q) = Q', () => {
+        const post = (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5));
+        (0, vitest_1.expect)((0, hoare_logic_1.wp)((0, hoare_logic_1.skip)(), post)).toEqual(post);
+    });
+    (0, vitest_1.it)('wp(x := 5, x == 5) = (5 == 5)', () => {
+        const post = (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5));
+        const result = (0, hoare_logic_1.wp)((0, hoare_logic_1.assign)('x', (0, hoare_logic_1.num)(5)), post);
+        // post[5/x] = (5 == 5)
+        (0, vitest_1.expect)(result).toEqual((0, hoare_logic_1.eq)((0, hoare_logic_1.num)(5), (0, hoare_logic_1.num)(5)));
+        // Y semánticamente: 5 == 5 es true
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)(result, {})).toBe(true);
+    });
+    (0, vitest_1.it)('wp(x := y + 1, x > 0) = (y + 1 > 0)', () => {
+        const post = (0, hoare_logic_1.binop)('>', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(0));
+        const result = (0, hoare_logic_1.wp)((0, hoare_logic_1.assign)('x', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('y'), (0, hoare_logic_1.num)(1))), post);
+        (0, vitest_1.expect)(result).toEqual((0, hoare_logic_1.binop)('>', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('y'), (0, hoare_logic_1.num)(1)), (0, hoare_logic_1.num)(0)));
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)(result, { y: 5 })).toBe(true);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)(result, { y: -5 })).toBe(false);
+    });
+    (0, vitest_1.it)('wp seq decompone derecha → izquierda', () => {
+        // {x := 1; y := x + 1} {y == 2}
+        // wp(y := x+1, y == 2) = (x+1 == 2)
+        // wp(x := 1, x+1 == 2) = (1+1 == 2) → true
+        const stmt = (0, hoare_logic_1.seq)((0, hoare_logic_1.assign)('x', (0, hoare_logic_1.num)(1)), (0, hoare_logic_1.assign)('y', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(1))));
+        const post = (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('y'), (0, hoare_logic_1.num)(2));
+        const result = (0, hoare_logic_1.wp)(stmt, post);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)(result, {})).toBe(true);
+    });
+    (0, vitest_1.it)('wp(if B then c1 else c2) combina ambas ramas', () => {
+        // if x > 0 then y := 1 else y := -1
+        // post: y > -2 (siempre cierto)
+        const stmt = (0, hoare_logic_1.ifS)((0, hoare_logic_1.binop)('>', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(0)), (0, hoare_logic_1.assign)('y', (0, hoare_logic_1.num)(1)), (0, hoare_logic_1.assign)('y', (0, hoare_logic_1.num)(-1)));
+        const post = (0, hoare_logic_1.binop)('>', (0, hoare_logic_1.v)('y'), (0, hoare_logic_1.num)(-2));
+        const result = (0, hoare_logic_1.wp)(stmt, post);
+        // Vale para cualquier estado.
+        for (const xVal of [-5, -1, 0, 1, 5]) {
+            (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)(result, { x: xVal })).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('wp(while sin invariant) = false', () => {
+        const stmt = (0, hoare_logic_1.whileS)((0, hoare_logic_1.binop)('<', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(10)), (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(1))));
+        (0, vitest_1.expect)((0, hoare_logic_1.wp)(stmt, (0, hoare_logic_1.bool)(true))).toEqual((0, hoare_logic_1.bool)(false));
+    });
+    (0, vitest_1.it)('wp(while con invariant) = invariant', () => {
+        const I = (0, hoare_logic_1.le)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(10));
+        const stmt = (0, hoare_logic_1.whileS)((0, hoare_logic_1.binop)('<', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(10)), (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(1))), I);
+        (0, vitest_1.expect)((0, hoare_logic_1.wp)(stmt, (0, hoare_logic_1.bool)(true))).toEqual(I);
+    });
+});
+(0, vitest_1.describe)('hoare-logic — strongest postcondition (sp)', () => {
+    (0, vitest_1.it)('sp(skip, P) = P', () => {
+        const pre = (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(0));
+        (0, vitest_1.expect)((0, hoare_logic_1.spExtension)((0, hoare_logic_1.skip)(), pre)).toEqual(pre);
+    });
+    (0, vitest_1.it)('sp(x := 5, true) implica x == 5', () => {
+        const stmt = (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.num)(5));
+        const result = (0, hoare_logic_1.spExtension)(stmt, (0, hoare_logic_1.bool)(true));
+        // Debería implicar x == 5 al menos para muestreo concreto.
+        const state = { x: 5 };
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)(result, state)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('hoare-logic — execStmt concreto', () => {
+    (0, vitest_1.it)('ejecuta swap correctamente', () => {
+        const swap = (0, hoare_logic_1.programSwap)();
+        const initial = { x: 7, y: 13 };
+        const final = (0, hoare_logic_1.execStmt)(swap, initial);
+        (0, vitest_1.expect)('error' in final).toBe(false);
+        if (!('error' in final)) {
+            (0, vitest_1.expect)(final.x).toBe(13);
+            (0, vitest_1.expect)(final.y).toBe(7);
+        }
+    });
+    (0, vitest_1.it)('ejecuta factorial concretamente para n pequeños', () => {
+        const fact = (0, hoare_logic_1.programFactorial)();
+        for (const n of [0, 1, 2, 3, 5, 6]) {
+            const final = (0, hoare_logic_1.execStmt)(fact, { n });
+            (0, vitest_1.expect)('error' in final).toBe(false);
+            if (!('error' in final)) {
+                (0, vitest_1.expect)(final.r).toBe((0, hoare_logic_1.factorial)(n));
+            }
+        }
+    });
+    (0, vitest_1.it)('ejecuta GCD por restas correctamente', () => {
+        const gcdProg = (0, hoare_logic_1.programGCD)();
+        const cases = [
+            [12, 18, 6],
+            [21, 14, 7],
+            [9, 9, 9],
+            [100, 75, 25],
+            [13, 7, 1],
+        ];
+        for (const [x, y, expected] of cases) {
+            const final = (0, hoare_logic_1.execStmt)(gcdProg, { x, y });
+            (0, vitest_1.expect)('error' in final).toBe(false);
+            if (!('error' in final)) {
+                (0, vitest_1.expect)(final.x).toBe(expected);
+                (0, vitest_1.expect)(final.y).toBe(expected);
+                (0, vitest_1.expect)(final.x).toBe((0, hoare_logic_1.gcd)(x, y));
+            }
+        }
+    });
+    (0, vitest_1.it)('respeta el límite de pasos en loops divergentes', () => {
+        // while true do skip
+        const infinite = (0, hoare_logic_1.whileS)((0, hoare_logic_1.num)(1), (0, hoare_logic_1.skip)());
+        const final = (0, hoare_logic_1.execStmt)(infinite, {}, 50);
+        (0, vitest_1.expect)('error' in final).toBe(true);
+    });
+    (0, vitest_1.it)('if elige rama correcta según condición', () => {
+        const stmt = (0, hoare_logic_1.ifS)((0, hoare_logic_1.binop)('>', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(0)), (0, hoare_logic_1.assign)('y', (0, hoare_logic_1.num)(1)), (0, hoare_logic_1.assign)('y', (0, hoare_logic_1.num)(-1)));
+        const a = (0, hoare_logic_1.execStmt)(stmt, { x: 5 });
+        const b = (0, hoare_logic_1.execStmt)(stmt, { x: -3 });
+        (0, vitest_1.expect)(!('error' in a) && a.y === 1).toBe(true);
+        (0, vitest_1.expect)(!('error' in b) && b.y === -1).toBe(true);
+    });
+});
+(0, vitest_1.describe)('hoare-logic — verifyTriple', () => {
+    (0, vitest_1.it)('verifica {x = 5} skip {x = 5}', () => {
+        const triple = {
+            pre: (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5)),
+            stmt: (0, hoare_logic_1.skip)(),
+            post: (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5)),
+        };
+        const result = (0, hoare_logic_1.verifyTriple)(triple, { samples: 50 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('verifica {true} x := 5 {x = 5}', () => {
+        const triple = {
+            pre: (0, hoare_logic_1.bool)(true),
+            stmt: (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.num)(5)),
+            post: (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5)),
+        };
+        const result = (0, hoare_logic_1.verifyTriple)(triple, { samples: 50 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('verifica {x = a ∧ y = b} swap {x = b ∧ y = a}', () => {
+        // El swap usa la variable temporal `t`, por lo que la pre y post
+        // se expresan sobre x e y; introducimos a y b como variables
+        // matemáticas (ghost vars) que se preservan.
+        const triple = {
+            pre: (0, hoare_logic_1.and)((0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.v)('a')), (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('y'), (0, hoare_logic_1.v)('b'))),
+            stmt: (0, hoare_logic_1.programSwap)(),
+            post: (0, hoare_logic_1.and)((0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.v)('b')), (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('y'), (0, hoare_logic_1.v)('a'))),
+        };
+        const result = (0, hoare_logic_1.verifyTriple)(triple, { samples: 100, range: [-3, 3] });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('detecta contraejemplo en tripleta incorrecta', () => {
+        // {x = 0} x := x + 1 {x = 0}  → falso
+        const triple = {
+            pre: (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(0)),
+            stmt: (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(1))),
+            post: (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(0)),
+        };
+        const result = (0, hoare_logic_1.verifyTriple)(triple, { samples: 30, seed: 42 });
+        (0, vitest_1.expect)(result.valid).toBe(false);
+        (0, vitest_1.expect)(result.failures.length).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('rechaza while sin invariant', () => {
+        const triple = {
+            pre: (0, hoare_logic_1.bool)(true),
+            stmt: (0, hoare_logic_1.whileS)((0, hoare_logic_1.binop)('<', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(10)), (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(1)))),
+            post: (0, hoare_logic_1.bool)(true),
+        };
+        const result = (0, hoare_logic_1.verifyTriple)(triple, { samples: 10 });
+        (0, vitest_1.expect)(result.valid).toBe(false);
+    });
+    (0, vitest_1.it)('verifica {n ≥ 0} factorial(n) {r = n!} para n pequeños via execStmt', () => {
+        // Verificación semántica concreta (complementa los VCs sintácticos).
+        const fact = (0, hoare_logic_1.programFactorial)();
+        for (const n of [0, 1, 2, 4, 6]) {
+            const final = (0, hoare_logic_1.execStmt)(fact, { n });
+            (0, vitest_1.expect)('error' in final).toBe(false);
+            if (!('error' in final)) {
+                (0, vitest_1.expect)(final.r).toBe((0, hoare_logic_1.factorial)(n));
+            }
+        }
+    });
+    (0, vitest_1.it)('verifica invariant válido del while incrementor', () => {
+        // {x ≤ 5} while x < 5 do x := x + 1 {x = 5}
+        // invariant: x ≤ 5
+        const triple = {
+            pre: (0, hoare_logic_1.le)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5)),
+            stmt: (0, hoare_logic_1.whileS)((0, hoare_logic_1.binop)('<', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5)), (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(1))), (0, hoare_logic_1.le)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5))),
+            post: (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5)),
+        };
+        const result = (0, hoare_logic_1.verifyTriple)(triple, { samples: 100, range: [0, 5], seed: 7 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+});
+(0, vitest_1.describe)('hoare-logic — generación de VCs', () => {
+    (0, vitest_1.it)('generateVCs incluye 1 VC global para asignación simple', () => {
+        const triple = {
+            pre: (0, hoare_logic_1.bool)(true),
+            stmt: (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.num)(5)),
+            post: (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5)),
+        };
+        const vcs = (0, hoare_logic_1.generateVCs)(triple);
+        (0, vitest_1.expect)(vcs.length).toBe(1);
+    });
+    (0, vitest_1.it)('generateVCs añade 2 VCs por cada while (mantenimiento + salida)', () => {
+        const triple = {
+            pre: (0, hoare_logic_1.bool)(true),
+            stmt: (0, hoare_logic_1.whileS)((0, hoare_logic_1.binop)('<', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5)), (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(1))), (0, hoare_logic_1.bool)(true)),
+            post: (0, hoare_logic_1.bool)(true),
+        };
+        const vcs = (0, hoare_logic_1.generateVCs)(triple);
+        // VC global + mantenimiento + salida = 3
+        (0, vitest_1.expect)(vcs.length).toBe(3);
+    });
+    (0, vitest_1.it)('un while sin invariant produce VC bool(false)', () => {
+        const triple = {
+            pre: (0, hoare_logic_1.bool)(true),
+            stmt: (0, hoare_logic_1.whileS)((0, hoare_logic_1.binop)('<', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(5)), (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.num)(1)))),
+            post: (0, hoare_logic_1.bool)(true),
+        };
+        const vcs = (0, hoare_logic_1.generateVCs)(triple);
+        // Al menos uno es bool(false).
+        (0, vitest_1.expect)(vcs.some((v) => v.kind === 'bool' && v.value === false)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('hoare-logic — variables libres y stmtVars', () => {
+    (0, vitest_1.it)('freeVars colecta variables de una expresión', () => {
+        const expr = (0, hoare_logic_1.and)((0, hoare_logic_1.eq)((0, hoare_logic_1.v)('x'), (0, hoare_logic_1.v)('a')), (0, hoare_logic_1.eq)((0, hoare_logic_1.v)('y'), (0, hoare_logic_1.v)('b')));
+        const vars = (0, hoare_logic_1.freeVars)(expr);
+        (0, vitest_1.expect)(vars.has('x')).toBe(true);
+        (0, vitest_1.expect)(vars.has('a')).toBe(true);
+        (0, vitest_1.expect)(vars.has('y')).toBe(true);
+        (0, vitest_1.expect)(vars.has('b')).toBe(true);
+        (0, vitest_1.expect)(vars.size).toBe(4);
+    });
+});
+(0, vitest_1.describe)('hoare-logic — linear search programa', () => {
+    (0, vitest_1.it)('linear search ejecuta sin error y respeta el invariant i ≤ n', () => {
+        const prog = (0, hoare_logic_1.programLinearSearch)();
+        const final = (0, hoare_logic_1.execStmt)(prog, { a: 3, target: 3, n: 5 });
+        (0, vitest_1.expect)('error' in final).toBe(false);
+        if (!('error' in final)) {
+            // a == target ⇒ found = 1 desde la primera iteración.
+            (0, vitest_1.expect)(final.found).toBe(1);
+            (0, vitest_1.expect)(final.i).toBeLessThanOrEqual(5);
+        }
+    });
+    (0, vitest_1.it)('linear search sale sin encontrar cuando a != target', () => {
+        const prog = (0, hoare_logic_1.programLinearSearch)();
+        const final = (0, hoare_logic_1.execStmt)(prog, { a: 1, target: 99, n: 3 });
+        (0, vitest_1.expect)('error' in final).toBe(false);
+        if (!('error' in final)) {
+            (0, vitest_1.expect)(final.found).toBe(0);
+            (0, vitest_1.expect)(final.i).toBe(3);
+        }
+    });
+});
+(0, vitest_1.describe)('hoare-logic — evaluación de expresiones primitivas', () => {
+    (0, vitest_1.it)('evalExpr maneja operadores aritméticos', () => {
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('+', (0, hoare_logic_1.num)(2), (0, hoare_logic_1.num)(3)), {})).toBe(5);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('-', (0, hoare_logic_1.num)(10), (0, hoare_logic_1.num)(4)), {})).toBe(6);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('*', (0, hoare_logic_1.num)(3), (0, hoare_logic_1.num)(4)), {})).toBe(12);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('/', (0, hoare_logic_1.num)(20), (0, hoare_logic_1.num)(4)), {})).toBe(5);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('/', (0, hoare_logic_1.num)(1), (0, hoare_logic_1.num)(0)), {})).toBe(0); // div por cero → 0
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('%', (0, hoare_logic_1.num)(10), (0, hoare_logic_1.num)(3)), {})).toBe(1);
+    });
+    (0, vitest_1.it)('evalExpr maneja relacionales', () => {
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('<', (0, hoare_logic_1.num)(1), (0, hoare_logic_1.num)(2)), {})).toBe(true);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('<=', (0, hoare_logic_1.num)(2), (0, hoare_logic_1.num)(2)), {})).toBe(true);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('>=', (0, hoare_logic_1.num)(2), (0, hoare_logic_1.num)(2)), {})).toBe(true);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('!=', (0, hoare_logic_1.num)(1), (0, hoare_logic_1.num)(2)), {})).toBe(true);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('==', (0, hoare_logic_1.num)(1), (0, hoare_logic_1.num)(2)), {})).toBe(false);
+    });
+    (0, vitest_1.it)('evalExpr maneja booleanos y not', () => {
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.and)((0, hoare_logic_1.bool)(true), (0, hoare_logic_1.bool)(false)), {})).toBe(false);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.or)((0, hoare_logic_1.bool)(true), (0, hoare_logic_1.bool)(false)), {})).toBe(true);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.not)((0, hoare_logic_1.bool)(false)), {})).toBe(true);
+    });
+    (0, vitest_1.it)('evalExpr trata variables no definidas como 0', () => {
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.v)('zzz'), {})).toBe(0);
+        (0, vitest_1.expect)((0, hoare_logic_1.evalExpr)((0, hoare_logic_1.binop)('+', (0, hoare_logic_1.v)('a'), (0, hoare_logic_1.num)(5)), {})).toBe(5);
+    });
+});
+(0, vitest_1.describe)('hoare-logic — invariants documentados', () => {
+    (0, vitest_1.it)('GCD: gcd(x, y) se mantiene tras una iteración del body', () => {
+        // Verifico el invariant SEMÁNTICAMENTE (no via VC sintáctica)
+        // ejecutando una iteración del body sobre estados varios.
+        for (let x = 2; x <= 8; x++) {
+            for (let y = 2; y <= 8; y++) {
+                if (x === y)
+                    continue;
+                const before = (0, hoare_logic_1.gcd)(x, y);
+                const body = (0, hoare_logic_1.ifS)((0, hoare_logic_1.binop)('>', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.v)('y')), (0, hoare_logic_1.assign)('x', (0, hoare_logic_1.binop)('-', (0, hoare_logic_1.v)('x'), (0, hoare_logic_1.v)('y'))), (0, hoare_logic_1.assign)('y', (0, hoare_logic_1.binop)('-', (0, hoare_logic_1.v)('y'), (0, hoare_logic_1.v)('x'))));
+                const final = (0, hoare_logic_1.execStmt)(body, { x, y });
+                (0, vitest_1.expect)('error' in final).toBe(false);
+                if (!('error' in final)) {
+                    const after = (0, hoare_logic_1.gcd)(final.x ?? 0, final.y ?? 0);
+                    (0, vitest_1.expect)(after).toBe(before);
+                }
+            }
+        }
+    });
+    (0, vitest_1.it)('Factorial invariant r·(k! relativo a n) mantiene r = k! tras body', () => {
+        // Tras j-ésima iteración debe valer r = j! (j = k al fin del body).
+        for (let n = 1; n <= 6; n++) {
+            const final = (0, hoare_logic_1.execStmt)((0, hoare_logic_1.programFactorial)(), { n });
+            (0, vitest_1.expect)('error' in final).toBe(false);
+            if (!('error' in final)) {
+                (0, vitest_1.expect)(final.r).toBe((0, hoare_logic_1.factorial)(n));
+                (0, vitest_1.expect)(final.k).toBe(n);
+            }
+        }
+    });
+});
+//# sourceMappingURL=hoare-logic.test.js.map