Shubham Ugare

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jacob Laurel

> Home > Persons > Shubham Ugare

Publications

2025
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/ftpl/SinghLMBSXUZ25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ftpl/SinghLMBSXUZ25
Gagandeep Singh, Jacob Laurel, Sasa Misailovic, Debangshu Banerjee, Avaljot Singh, Changming Xu, Shubham Ugare, Huan Zhang:
Safety and Trust in Artificial Intelligence with Abstract Interpretation. Found. Trends Program. Lang. 8(3-4): 250-408 (2025)
2022
[j2]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/pacmpl/LaurelYUNSM22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pacmpl/LaurelYUNSM22
Jacob Laurel, Rem Yang, Shubham Ugare, Robert Nagel, Gagandeep Singh, Sasa Misailovic:
A general construction for abstract interpretation of higher-order automatic differentiation. Proc. ACM Program. Lang. 6(OOPSLA2): 1007-1035 (2022)
2021
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/dac/LaurelYSUM21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dac/LaurelYSUM21
Jacob Laurel, Rem Yang, Atharva Sehgal, Shubham Ugare, Sasa Misailovic:
Statheros: Compiler for Efficient Low-Precision Probabilistic Programming. DAC 2021: 787-792

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.