[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: GNUism in groff tests, was: pic anomalies
From: |
Tadziu Hoffmann |
Subject: |
Re: GNUism in groff tests, was: pic anomalies |
Date: |
Sat, 4 Jan 2020 14:52:56 +0100 |
User-agent: |
Mutt/1.11.4 (2019-03-13) |
> A debugging build I made in December is about 20k lines
> before the preprocessor runs and about 30k afterwards.
> The formal verification code, written in Isabelle/HOL[2],
> is about an order of magnitude greater than that.
Just out of curiosity (since I'm unfamiliar with the concepts),
what is the code complexity like? If the verification code is
larger, is it also more complex? If yes, can the verification
code somehow be checked against possible errors as well?
- Re: GNUism in groff tests, was: pic anomalies, (continued)
- Re: GNUism in groff tests, was: pic anomalies, G. Branden Robinson, 2020/01/03
- Re: GNUism in groff tests, was: pic anomalies, Doug McIlroy, 2020/01/03
- Re: GNUism in groff tests, was: pic anomalies, G. Branden Robinson, 2020/01/03
- Re: GNUism in groff tests, was: pic anomalies,
Tadziu Hoffmann <=
- Re: GNUism in groff tests, was: pic anomalies, G. Branden Robinson, 2020/01/03