Umang Mathur

@mathur_umang

PhD student at University of Illinois, Urbana-Champaign. 𝗢𝗻 𝘁𝗵𝗲 𝗮𝗰𝗮𝗱𝗲𝗺𝗶𝗰 𝗷𝗼𝗯 𝗺𝗮𝗿𝗸𝗲𝘁.

Champaign, IL
Vrijeme pridruživanja: svibanj 2013.

Tweetovi

Blokirali ste korisnika/cu @mathur_umang

Jeste li sigurni da želite vidjeti te tweetove? Time nećete deblokirati korisnika/cu @mathur_umang

  1. proslijedio/la je Tweet
    21. pro 2019.

    's grad student placement is AMAZING! The department placed 15 faculty members (may be more) in top universities in 2019, incl. MIT, CMU, Cornell, Georgia Tech, and my UCSD (go Triton!) 2020 will be another great year! We have SO MANY strong students on the market!

    Poništi
  2. 19. stu 2019.

    The paper is supposedly a pleasant read. In the words of one of the reviewers - "𝙏𝙝𝙞𝙨 𝙞𝙨 𝙖 𝙗𝙚𝙖𝙪𝙩𝙞𝙛𝙪𝙡𝙡𝙮-𝙬𝙧𝙞𝙩𝙩𝙚𝙣 𝙩𝙝𝙚𝙤𝙧𝙮 𝙥𝙖𝙥𝙚𝙧 𝙩𝙝𝙖𝙩 𝙝𝙖𝙨 𝙖 𝙧𝙚𝙖𝙡 𝙖𝙥𝙥𝙡𝙞𝙘𝙖𝙩𝙞𝙤𝙣 𝙖𝙨 𝙬𝙚𝙡𝙡." So folks out there, do give it a read ! (6/6)

    Prikaži ovu nit
    Poništi
  3. 19. stu 2019.

    Flanagan et al proposed Velodrome (), a graph-based quadratic time algorithm to dynamically check for violations of conflict serializability. In our paper, we resort to vector clocks to design a 𝗹𝗶𝗻𝗲𝗮𝗿 𝘁𝗶𝗺𝗲 algorithm for the same problem🤘 (5/6)

    Prikaži ovu nit
    Poništi
  4. 19. stu 2019.

    Checking conflict serializability then amounts to checking if an observed execution can be "reordered" so that these nominal atomic blocks can indeed be executed serially. (4/6)

    Prikaži ovu nit
    Poništi
  5. 19. stu 2019.

    The idea is that programmers can 𝘢𝘴𝘴𝘶𝘮𝘦 that the runtime will execute these "atomic" blocks serially (without context switching when executing such a block). The runtime however is not forced to respect these annotations and can perform arbitrary context switching. (3/6)

    Prikaži ovu nit
    Poništi
  6. 19. stu 2019.

    Conflict serializability is a widely adopted notion and is a means to specify an atomicity property in concurrent programs. Blocks of code can be marked "atomic". (2/6)

    Prikaži ovu nit
    Poništi
  7. 19. stu 2019.

    We came up with a scalable algorithm for checking conflict serializability dynamically and it has been selected to appear in ASPLOS'20 ! Preprint: . Apparently, "theory"-ish papers do get into ASPLOS 😃 (1/6)

    Prikaži ovu nit
    Poništi
  8. 19. stu 2019.

    The kicker: we can now use this class to track other properties such as memory safety (still without invariants!) and apply our technique to verify (or detect violations of) memory safety on a suite of library routines.

    Prikaži ovu nit
    Poništi
  9. 19. stu 2019.

    We identify characterizations of heaps for which aliasing relationships can be effectively tracked, giving us our desired decidability result for completely automatic verification.

    Prikaži ovu nit
    Poništi
  10. 19. stu 2019.

    The challenge this time was to model pointer updates on heaps. Incorporating updatable maps turned out to be surprisingly hard, and arises due to the aliasing problem --- "do variables x and y point to the same memory location?"

    Prikaži ovu nit
    Poništi
  11. 19. stu 2019.

    This work stems from our POPL2019 work () where we identified classes of uninterpreted programs which admit decidability for completely automatic verification (without even any loop invariants!).

    Prikaži ovu nit
    Poništi
  12. 19. stu 2019.

    Excited to announce that our work on decidable reasoning for memory safety is selected to appear at POPL2020 ! Preprint:

    Prikaži ovu nit
    Poništi
  13. 3. stu 2019.

    Denied my first conference review request. Feels empowering 💪🏼

    Poništi
  14. 23. ruj 2019.

    Catch a glimpse of some of the exciting extensions of this work at happening now

    Poništi
  15. 23. ruj 2019.

    Exciting work at UIUC on foundational results in program synthesis. Read more here:

    Poništi
  16. proslijedio/la je Tweet
    5. ruj 2019.

    Reflecting our continued commitment to supporting and building relationships with the academic community, we are excited to announce the 2019 class of Google PhD Fellows for North America, Europe, Asia, Australia and the Middle East!

    Poništi
  17. proslijedio/la je Tweet
    1. srp 2019.

    So has published documents describing the scientific fraud and abusive lab culture that allegedly lead Huixing Chen to take his own life. Trigger Warning: (1/n)

    Prikaži ovu nit
    Poništi
  18. proslijedio/la je Tweet

    Only a week until the June 15 deadline to apply for Rising Stars, the annual academic career workshop for women in EECS!

    Poništi
  19. 5. lip 2019.

    Are there good reasons why PL and SE conferences do not have rolling deadlines? CC:

    Poništi
  20. 29. svi 2019.

    Excited about this news! Chuchu is an amazing researcher, amazing collaborator and an even amazing person!

    Poništi

Čini se da učitavanje traje već neko vrijeme.

Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.

    Možda bi vam se svidjelo i ovo:

    ·