Paul Grosu

Hi Orion (@opoplawski) and Dave (@loveshack), Thank you for the opportunity of sponsorship. I apologize for the delayed response as I was trying to familiarize myself with the Fedora process....

And I did this from Dekaksi following the instructions from here: https://github.com/dmtcp/dmtcp/wiki/DMTCP-GIT-Cheatsheet :)

Hey Kapil (@karya0) regarding your question on the pre-commit formatting-check. So initially I did this on Windows and Rohan mentioned I should do it on Linux so that the style-check...

So I documented my progress in the following document (see PDF link below) which led me to reach the current implementation. The methodology I followed was to perform dataflow analysis...

Hi Rohan, Yes of course a local commit first, as the wiki instructs. Here's a list from my Dekaksi history as to the exact steps and never got it to...

Coercion semantics usually have another requirement called *coherence* that needs to be satisfied, which is much more difficult to prove. For reference, here one of the papers: https://link.springer.com/chapter/10.1007%2F3-540-54415-1_70 I have...

Maybe take a look at this: https://github.com/gfanton/grpc-quic

Anything is possible. Here a few standard algorithms (BFS/DFS) for doing this: http://en.wikipedia.org/wiki/Breadth-first_search http://en.wikipedia.org/wiki/Depth-first_search If you want you can even do topological sorting to speed some things up: http://en.wikipedia.org/wiki/Topological_sorting If...

Thank you @ekg for the examples and code. Definitely a strong +1 on more documentation. I'm also doing some catching up. Thanks, Paul

It's great to see some mathematical analysis :) ~p