Browse zlib specs (58 of 62)
Proofs / zlib / Earlier, longer properties
x_compress_roundtrip
For data of up to 1 MiB and any level: compress2 into compressBound bytes returns Z_STREAM_ERROR exactly for a level outside -1..9, else Z_OK with at most that many bytes; uncompress and uncompress2 give back exactly the data; with one byte too little room uncompress returns Z_BUF_ERROR, and a truncated stream is never accepted.
- spec
- 77 lines of C
- with its headers
- 232 lines
- status
- Proved
- 58 of 62
On this page
The spec
The spec is the C program harness/x_compress_roundtrip.c, 77 lines, shown whole as it is in the repository at 37189f4. It includes harness/zlib_common.h (155 lines). Its first comment states the property in full, with every bound.
// Law compress_roundtrip: the one-call utility functions. For ANY data of n <= 2^20 bytes and ANY level (any int):
// - compress2(dest, &destLen, data, n, level) with destLen = compressBound(n) and dest an object of exactly that many
// bytes returns Z_STREAM_ERROR exactly for a level not in -1..9, else Z_OK (or Z_MEM_ERROR), with destLen
// at most compressBound(n); compress() (level -1) the same;
// - uncompress(out, &outLen, dest, destLen) with outLen = n and out an object of exactly n bytes (any contents)
// returns Z_OK with outLen = n and out = data; uncompress2 does too and sets its source length to destLen;
// - when n > 0: uncompress with exactly n - 1 bytes of output space returns Z_BUF_ERROR, having written at most
// n - 1 bytes; with only the first k < destLen compressed bytes (ANY k) uncompress returns Z_DATA_ERROR or
// Z_BUF_ERROR (an incomplete stream is never accepted).
// (Allocation failures, Z_MEM_ERROR, end the run.) Bounds: n <= 2^20.
#include "zlib_common.h"
#define GP_N_MAX (1u << 20)
int main(void)
{
const unsigned n = nondet_u32();
const int level = (int) nondet_u32();
const unsigned k = nondet_u32();
const unsigned char plain = nondet_u8();
gp_assume(n <= GP_N_MAX);
unsigned char *data = malloc(n);
if (data == NULL)
return 0;
nondet_bytes(data, n);
const uLong cb = compressBound(n);
unsigned char *dest = malloc(cb);
if (dest == NULL)
return 0;
uLongf dlen = cb;
int r;
if (plain == 0)
r = compress(dest, &dlen, data, n);
else
r = compress2(dest, &dlen, data, n, level);
const int lev_ok = plain == 0 || (level >= -1 && level <= 9);
if (r == Z_MEM_ERROR)
return 0;
gp_assert((r == Z_STREAM_ERROR) == !lev_ok);
if (!lev_ok)
return 0;
gp_assert(r == Z_OK);
gp_assert(dlen <= cb);
unsigned char *out = malloc(n);
if (out == NULL)
return 0;
nondet_bytes(out, n);
uLongf olen = n;
r = uncompress(out, &olen, dest, dlen);
if (r == Z_MEM_ERROR)
return 0;
gp_assert(r == Z_OK && olen == n && bytes_same(out, data, n));
nondet_bytes(out, n);
olen = n;
uLong slen = dlen;
r = uncompress2(out, &olen, dest, &slen);
if (r == Z_MEM_ERROR)
return 0;
gp_assert(r == Z_OK && olen == n && slen == dlen && bytes_same(out, data, n));
if (n > 0) {
unsigned char *small = malloc(n - 1);
if (small == NULL)
return 0;
olen = n - 1;
r = uncompress(small, &olen, dest, dlen);
if (r == Z_MEM_ERROR)
return 0;
gp_assert(r == Z_BUF_ERROR && olen <= n - 1);
}
gp_assume(k < dlen);
olen = n;
r = uncompress(out, &olen, dest, k);
if (r == Z_MEM_ERROR)
return 0;
gp_assert(r == Z_DATA_ERROR || r == Z_BUF_ERROR);
return 0;
}harness/zlib_common.h, 155 lines
// Shared by the zlib harnesses (zlib 1.3.2 core: adler32.c, crc32.c, deflate.c, trees.c, inflate.c, inffast.c,
// inftrees.c, compress.c, uncompr.c, zutil.c).
//
// A harness draws every input from quickproof.h (nondet_*, pick), restricts it with gp_assume, and states each property
// with gp_assert (undefined behaviour when the property fails). Buffers have exactly the size the claim allows. Every
// call of inflate() or deflate() gets its input and its output space as objects of their own, allocated with exactly
// avail_in and avail_out bytes (exact_copy, exact_space): an access before next_in, after next_in + avail_in, before
// next_out or after next_out + avail_out is then outside an object, i.e. undefined behaviour in the semantics of the
// theorem, so "inflate reads only the input it is offered and writes only the space it is offered" is part of every
// law's "no undefined behaviour".
//
// The reference facts, written from the definitions, not from zlib:
// - Adler-32 (RFC 1950 8.2): s1 = 1 + the sum of the bytes, s2 = the sum of the successive values of s1, both mod
// 65521; the checksum is s2 * 65536 + s1. ref_adler32 updates a checksum byte by byte;
// - CRC-32 (RFC 1952 8, ISO 3309): the reflected polynomial 0xedb88320, register preset to all ones and inverted at
// the end. ref_crc32 updates a checksum bit by bit;
// - the zlib wrapper (RFC 1950): 2 header bytes, an optional 4-byte dictionary id (big-endian Adler-32 of the
// dictionary), the deflate data, then the big-endian Adler-32 of the uncompressed data;
// - the gzip wrapper (RFC 1952): a header of at least 10 bytes (1f 8b 08 FLG MTIME(4) XFL OS, then the optional
// fields), the deflate data, then the little-endian CRC-32 and the little-endian length mod 2^32 of the data;
// - the inflate windowBits of zlib.h: 8..15 (zlib wrapper, 2^windowBits window), 0 (zlib wrapper, the window size of
// the header), -8..-15 (raw deflate), + 16 (gzip wrapper only; 16 itself: the window size of the header), + 32
// (zlib or gzip, detected); everything else is rejected with Z_STREAM_ERROR.
#ifndef ZLIB_HARNESS_COMMON_H
#define ZLIB_HARNESS_COMMON_H
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include "quickproof.h"
#include "zlib.h"
#define GP_BASE 65521ul // the Adler-32 modulus (RFC 1950)
#define GP_POLY 0xedb88320ul // the CRC-32 polynomial, reflected (RFC 1952)
// Adler-32 of buf[0..n-1] continued from the checksum a (both halves < 65521 for a checksum).
static unsigned long ref_adler32(unsigned long a, const unsigned char *buf, unsigned long n)
{
unsigned long s1 = a & 0xffff;
unsigned long s2 = (a >> 16) & 0xffff;
for (unsigned long i = 0; i < n; ++i) {
s1 = (s1 + buf[i]) % GP_BASE;
s2 = (s2 + s1) % GP_BASE;
}
return (s2 << 16) | s1;
}
// The CRC-32 register update by one byte, without pre- or post-conditioning (the register is the 32 low bits).
static unsigned long ref_crc_byte(unsigned long c, unsigned char b)
{
c ^= b;
for (int k = 0; k < 8; ++k) {
if (c & 1)
c = (c >> 1) ^ GP_POLY;
else
c = c >> 1;
}
return c;
}
// CRC-32 of buf[0..n-1] continued from the checksum c (its 32 low bits).
static unsigned long ref_crc32(unsigned long c, const unsigned char *buf, unsigned long n)
{
c = (~c) & 0xffffffff;
for (unsigned long i = 0; i < n; ++i)
c = ref_crc_byte(c, buf[i]);
return (~c) & 0xffffffff;
}
static unsigned long be32(const unsigned char *p)
{
return ((unsigned long) p[0] << 24) | ((unsigned long) p[1] << 16) | ((unsigned long) p[2] << 8) | p[3];
}
static unsigned long le32(const unsigned char *p)
{
return ((unsigned long) p[3] << 24) | ((unsigned long) p[2] << 16) | ((unsigned long) p[1] << 8) | p[0];
}
static int bytes_same(const unsigned char *a, const unsigned char *b, unsigned long n)
{
for (unsigned long i = 0; i < n; ++i)
if (a[i] != b[i])
return 0;
return 1;
}
static void bytes_copy(unsigned char *d, const unsigned char *s, unsigned long n)
{
for (unsigned long i = 0; i < n; ++i)
d[i] = s[i];
}
// A new object of exactly n bytes holding src[0..n-1] (NULL when the allocation fails).
static unsigned char *exact_copy(const unsigned char *src, unsigned n)
{
unsigned char *p = malloc(n);
if (p != NULL)
bytes_copy(p, src, n);
return p;
}
// A new object of exactly n bytes with any contents, and a snapshot of them in *snap (NULL when an allocation fails).
static unsigned char *exact_space(unsigned n, unsigned char **snap)
{
unsigned char *p = malloc(n);
unsigned char *q = malloc(n);
if (p == NULL || q == NULL) {
free(p);
free(q);
*snap = NULL;
return NULL;
}
nondet_bytes(p, n);
bytes_copy(q, p, n);
*snap = q;
return p;
}
// inflateInit2's windowBits check (zlib.h): accepted values.
static int inflate_wbits_ok(int w)
{
if (w < 0)
return w >= -15 && w <= -8;
if (w >= 48)
return 0;
w &= 15;
return w == 0 || (w >= 8 && w <= 15);
}
// Is a value one of inflate()'s documented return codes (zlib.h)?
static int inflate_code_ok(int r)
{
return r == Z_OK || r == Z_STREAM_END || r == Z_NEED_DICT || r == Z_DATA_ERROR || r == Z_STREAM_ERROR ||
r == Z_MEM_ERROR || r == Z_BUF_ERROR;
}
// A z_stream with the default allocator (zalloc, zfree, opaque all Z_NULL: zlib uses zcalloc/zcfree, i.e. malloc and
// free) and any values in the fields the caller does not have to set.
static void stream_defaults(z_stream *s)
{
s->zalloc = Z_NULL;
s->zfree = Z_NULL;
s->opaque = Z_NULL;
s->next_in = Z_NULL;
s->avail_in = 0;
s->next_out = Z_NULL;
s->avail_out = 0;
pick(s->total_in);
pick(s->total_out);
pick(s->adler);
pick(s->data_type);
pick(s->reserved);
}
#endifThe theorem
QuickProof generated this statement from the spec, in src/contracts/x_compress_roundtrip.v:
Theorem x_compress_roundtrip : 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:
Theorem x_compress_roundtrip : harness_safe Zlib.contracts.x_compress_roundtrip.whole_prog.
Proof. exact (proj1 (proj2 (proj2 Zlib.contracts.suite.suite_x))). 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
adler32.ccrc32.cdeflate.ctrees.cinflate.cinffast.cinftrees.ccompress.cuncompr.czutil.cquickproof/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), and binaries built by a compiler (the theorem is about the code as CompCert defines C for x86_64, LP64), one thread.
- Where zlib reports
Z_MEM_ERROR, most specs end the run and claim nothing about it; the first comment of the spec says so. - The edits to zlib's code, listed in the repository, are tested, not proved.
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.