From 002fe016beb4e5aa37b9bbbf19d3a01911b44013 Mon Sep 17 00:00:00 2001 From: Nigel Tao Date: Fri, 7 Jul 2017 16:11:23 +1000 Subject: [PATCH] Add README.md section on other Static Checkers. --- README.md | 47 +++++++++++++++++++++++++++++++++++++++-------- 1 file changed, 39 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index 298c1245..83be9c48 100644 --- a/README.md +++ b/README.md @@ -283,6 +283,41 @@ that all the way through to C code generation and testing. # Related Work +## Existing Static Checkers + +Puffs is a language by itself, integrated with a compiler, not something +embedded in the comments of another language's program, supported by a separate +program checker, as the bounds check elimination affects the generated code. + +[Checked C](https://www.microsoft.com/en-us/research/project/checked-c/) has a +similar goal of safety, but aims to be backwards compatible with C, including +the idiomatic ways in which C code plays fast and loose with pointers and +arrays, and implicitly inserting run time checks while maintaining existing +data layout (e.g. the sizeof a struct type) for interoperability with other +systems. This is a much harder problem than Puffs' approach of a new, simple, +domain-specific programming language. + +Extended Static Checker for Java (ESC/Java) and its successor +[OpenJML](http://www.openjml.org/), which obviously target the Java programming +language, similarly has to analyze a language that is more complicated that +Puffs. Java is also not commonly used for writing e.g. low level image codecs, +as the language lacks unsigned integer types, it is garbage collected and +idiomatic code often allocates. + +[Spark ADA](http://libre.adacore.com/tools/spark-gpl-edition/) targets a subset +of the Ada programming language, which again is more complicated than Puffs. It +also allows for pluggable theorem provers such as Z3. This can increase +programmer productivity in that it can take less effort to prove more programs +safe, but it also affects reproducibility: when some programs that are provable +in one programmer's configuration are unprovable in another. It's also not +obvious up front what effect different theorem provers, and their different +heuristics, will have on compile times or proof times. In constrast, Puffs' +proof system is fast (and dumb) instead of smart (and slow). + +We're not claiming that "use a state of the art theorem prover" is an +unworkable approach. It's just a different approach, with different trade-offs. + + ## Why a New Language? Simpler languages are easier to prove things about. Macros, inheritance, @@ -304,10 +339,6 @@ by millions of pixels. It is important to represent e.g. an RGBA pixel as four u8 values (or one u32), not as four naturally-sized-for-the-CPU integers or four big precision integers. -It is a language by itself, integrated with a compiler, not something embedded -in the comments of another language's program, supported by a separate program -checker, as the bounds check elimination affects the generated code. - ## Why Not Rust? @@ -319,8 +350,8 @@ great binary-level interop with C code, and Mozilla are reporting progress with parsing media formats in Rust, but it's still a non-zero operational hurdle to grow a project's build process and to assess build times and binary sizes. -We're not claiming that "write it in Rust" is an unworkable approach. It's just -a different approach, with different trade-offs. +Again, we're not claiming that "write it in Rust" is an unworkable approach. +It's just a different approach, with different trade-offs. [Nom](https://github.com/Geal/nom) is a [promising](http://spw17.langsec.org/papers/chifflier-parsing-in-2017.pdf) @@ -330,8 +361,8 @@ format that is easily expressible as a formal grammar. In particular, it also handles entropy encodings such as LZW (for GIF), ZLIB (for PNG, TODO) and Huffman (for JPEG, TODO). Puffs differs from nom combined with other Rust code (e.g. a Rust LZW implementation) in that bounds and overflow checks not just -ubiquitous but also completely eliminated at compile time. Again, we're not -claiming that nom or Rust are unworkable, just different. +ubiquitous but also completely eliminated at compile time. Once again, we're +not claiming that nom or Rust are unworkable, just different. # Status