Browse OpenSSL punycode specs (8 of 19)

Proofs / OpenSSL punycode / The standard

rfc_ace_any_case

ossl_a2ulabel converts a name that starts with xn--, Xn--, xN-- or XN-- the same way: the same result and the same buffer (RFC 3490 5: the ACE prefix is "xn--" or any capitalization thereof), when the allocation fails in neither call or in both.

spec
39 lines of C
with its headers
91 lines
status
Proved
8 of 19
On this page

The spec

The spec is the C program harness/rfc_ace_any_case.c, 39 lines, shown whole as it is in the repository at 7556530. It includes harness/laws_common.h (52 lines). Its first comment states the property in full, with every bound.

C
// Law rfc_ace_any_case: ossl_a2ulabel recognizes the ACE prefix in any case. RFC 3490 5: "The ToASCII and ToUnicode
// operations MUST recognize the ACE prefix in a case-insensitive manner. The ACE prefix for IDNA is "xn--" or any
// capitalization thereof." For any capitalization P of "xn--", any string s (any octets up to its NUL, any length the
// allocator provides) and any outlen, with two objects of exactly outlen octets holding the same arbitrary values:
// ossl_a2ulabel of P followed by s returns what it returns for "xn--" followed by s, and leaves the same octets in its
// buffer (when the allocation of its WPACKET record fails in neither call or in both). False on unpatched OpenSSL,
// which recognizes "xn--" only, fixed by patch D1.
#include "laws_common.h"

int main(void) {
	// Choose the inputs: any capitalization of "xn--", any string after it, any outlen and outlen octets
	size_t len = upto(PTRDIFF_MAX - 5);
	unsigned char *any_case = any_bytes(len + 5);       // P, s, NUL
	size_t outlen = nondet_size();
	unsigned char *out1 = any_bytes(outlen);
	unsigned char *out2 = copy_of(out1, outlen);
	if (any_case == NULL || out1 == NULL || out2 == NULL)
		return 0;
	any_case[0] = nondet_u8() == 0 ? 'X' : 'x';
	any_case[1] = nondet_u8() == 0 ? 'N' : 'n';
	any_case[2] = '-';
	any_case[3] = '-';
	any_case[len + 4] = 0;
	unsigned char *lower = copy_of(any_case, len + 5);  // "xn--", s, NUL
	if (lower == NULL)
		return 0;
	lower[0] = 'x';
	lower[1] = 'n';
	ossl_shim_zalloc_failed = 0;
	int r1 = ossl_a2ulabel((const char *) any_case, (char *) out1, outlen);
	int failed1 = ossl_shim_zalloc_failed;
	ossl_shim_zalloc_failed = 0;
	int r2 = ossl_a2ulabel((const char *) lower, (char *) out2, outlen);
	if (failed1 != ossl_shim_zalloc_failed)
		return 0;
	// Check
	gp_assert(r1 == r2 && bytes_eq(out1, out2, outlen));
	return 0;
}
harness/laws_common.h, 52 lines
C
// laws_common.h: trivial helpers shared by the short laws (each law includes it once). No models, no algorithms.
#include <stdint.h>
#include <stdlib.h>
#include "quickproof.h"
#include "crypto/punycode.h"                         // ossl_punycode_decode, ossl_a2ulabel
// OpenSSL's allocator in this build (patch/shim/ossl_shim.c): set to 1 when CRYPTO_zalloc fails (malloc may fail at
// any call in the theorems), and the number of its blocks not freed yet.
extern int ossl_shim_zalloc_failed;
extern long ossl_shim_live;
static size_t upto(size_t max) {                     // any value from 0 to max
	size_t value = nondet_size();
	return value < max ? value : max;
}
static unsigned char *any_bytes(size_t n) {          // a new object of n arbitrary bytes (NULL if malloc fails)
	unsigned char *bytes = malloc(n);
	if (bytes != NULL)
		nondet_bytes(bytes, n);
	return bytes;
}
static unsigned int *any_uints(size_t n) {           // a new array of n arbitrary unsigned ints (NULL if malloc fails)
	unsigned int *values = malloc(n * sizeof(unsigned int));
	for (size_t i = 0; values != NULL && i < n; i++)
		values[i] = nondet_u32();
	return values;
}
static unsigned char *copy_of(const unsigned char *source, size_t n) {   // a new object holding source[0..n-1]
	if (source == NULL)                                                   // (NULL if source is or malloc fails)
		return NULL;
	unsigned char *copy = malloc(n);
	for (size_t i = 0; copy != NULL && i < n; i++)
		copy[i] = source[i];
	return copy;
}
static int bytes_eq(const unsigned char *a, const unsigned char *b, size_t n) {   // a[0..n-1] == b[0..n-1]
	for (size_t i = 0; i < n; i++)
		if (a[i] != b[i])
			return 0;
	return 1;
}
static int uints_eq(const unsigned int *a, const unsigned int *b, size_t n) {     // a[0..n-1] == b[0..n-1]
	for (size_t i = 0; i < n; i++)
		if (a[i] != b[i])
			return 0;
	return 1;
}
static size_t last_delimiter(const unsigned char *s, size_t n) {   // the position of the last '-', 0 if none
	size_t last = 0;
	for (size_t i = 0; i < n; i++)
		if (s[i] == '-')
			last = i;
	return last;
}

The theorem

QuickProof generated this statement from the spec, in src/contracts/rfc_ace_any_case.v:

Rocq
Theorem rfc_ace_any_case : harness_safe whole_prog.

src/contracts/laws.v states it on the spec's own program, whole_prog (the spec linked with the code under test), with its proof:

Rocq
Theorem rfc_ace_any_case : harness_safe OpensslPunycode.contracts.rfc_ace_any_case.whole_prog.
Proof. exact (proj1 (proj2 (proj2 (proj2 (proj2 (proj2 (proj2 (proj2 OpensslPunycode.contracts.suite.suite)))))))). Qed.

Read as a statement about runs, it says that no run of the program has undefined behaviour or a failing check, for every value the spec can draw. That reading rests on VST's adequacy theorem, which is not yet instantiated in Rocq (formerly Coq) for QuickProof's environment.

The C files (units) its program links
  • crypto/punycode.c
  • patch/units/packet_ext.c
  • patch/shim/ossl_shim.c
  • quickproof/libc/libc.c

What it leaves out

  • What the first comment of the spec excludes, and its bounds.
  • Like every spec of this proof: termination (a run that never returns is not a counterexample), one thread, and binaries built by a compiler (the theorem is about the code as CompCert defines C for x86-64, in a release build, compiled against a small header shim instead of OpenSSL's generated headers).
  • The rest of OpenSSL: only crypto/punycode.c and the parts of crypto/packet.c it reaches are code under test.

The summary page says what the proof as a whole covers.

How it was proved

AI agents wrote the proof, and Rocq checks it. qp verify passes on this repository: this statement is the one generated from the spec at the contract commit, and its proof uses only Rocq's standard axioms and VST's abstract malloc library.