You signed in with another tab or window.Reload to refresh your session.You signed out in another tab or window.Reload to refresh your session.You switched accounts on another tab or window.Reload to refresh your session.Dismiss alert
@@ -26,7 +26,7 @@ The [uutils project](https://github.com/uutils/) is aiming at rewriting key Linu
26
26
27
27
Here are some steps to follow if you want to apply for a GSOC project
28
28
with uutils.
29
-
29
+
30
30
1.**Check the requirements.** You have to meet
31
31
[Google's requirements](https://developers.google.com/open-source/gsoc/faq#what_are_the_eligibility_requirements_for_participation) to apply. Specifically for uutils, it's best if you at
32
32
least know some Rust and have some familiarity with using the
@@ -64,7 +64,7 @@ Summarizing that page, each project should include:
64
64
##Implement`stty`
65
65
The`stty` utility is currently only partially implemented and should be expanded.
66
66
67
-
See issues:[#3859](https://github.com/uutils/coreutils/issues/3859),[#3860](https://github.com/uutils/coreutils/issues/3860),[#3861](https://github.com/uutils/coreutils/issues/3861),[#3862](https://github.com/uutils/coreutils/issues/3862),[#3863](https://github.com/uutils/coreutils/issues/3863).
67
+
See issues:[#3859](https://github.com/uutils/coreutils/issues/3859),[#3860](https://github.com/uutils/coreutils/issues/3860),[#3861](https://github.com/uutils/coreutils/issues/3861),[#3862](https://github.com/uutils/coreutils/issues/3862),[#3863](https://github.com/uutils/coreutils/issues/3863).
68
68
69
69
- Difficulty: Medium
70
70
- Size: 175 or 350 depending on the scope
@@ -168,7 +168,7 @@ and [issue 1456](https://github.com/uutils/coreutils/issues/1456) for more infor
168
168
- Rust
169
169
- Optimization techniques
170
170
- Mathematics
171
-
171
+
172
172
##Symbolic/Fuzz Testing and Formal Verification of Tool Grammars
173
173
174
174
See[Using Lightweight Formal Methods to Validate a Key Value Storage Node In Amazon S3](https://www.amazon.science/publications/using-lightweight-formal-methods-to-validate-a-key-value-storage-node-in-amazon-s3).
@@ -191,8 +191,8 @@ Specific to `wc` - formalize the inner loop over a UTF-8 buffer into a finite st
191
191
- Alloy, TLA+,[P](https://github.com/p-org/P)
192
192
- System call tracing with[strace](https://jvns.ca/blog/2014/02/17/spying-on-ssh-with-strace/),[uftrace](https://github.com/namhyung/uftrace) etc.
193
193
- SMT solvers like[Z3](https://www.philipzucker.com/programming-and-interactive-proving-with-z3py/) and CVC5 for superoptimization and proofs of automata equivalence.
- Basic statistics on quantiles (histograms) for outlier detection. The math is simple as generalizing from one to k medians but the formal notation is[complex](https://aakinshin.net/posts/thdqe-hdi/).
- Basic statistics on quantiles (histograms) for outlier detection. The math is simple as generalizing from one to k medians but the formal notation is[complex](https://aakinshin.net/posts/thdqe-hdi/).
196
196
-[MPI-IO](https://wgropp.cs.illinois.edu/courses/cs598-s16/lectures/lecture32.pdf), just enough to read a file into k parts and combine "wc" outputs to understand multicore scaling.
197
197
198
198
##Development of advanced terminal session recording and replay tools in Rust
@@ -216,4 +216,3 @@ We want to support the Redox operating system, but are not actively testing agai