default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAditya V. Thakur
Person information
- affiliation: Google
- affiliation: University of California, Davis, CA, USA
Other persons with the same name
- Aditya Thakur 0002 — Missouri University of Science and Technology, Rolla, MO, USA
- Aditya Thakur 0003 (aka: Aditya Shankar Thakur) — Rochester Institute of Technology, USA
- Aditya Thakur 0004 — New York University, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Stephanie Nawas
, Zhe Tao, Aditya V. Thakur:
Provable Repair of Vision Transformers. SAIV 2024: 156-178- [c29]Patrick J. Chapman, Cindy Rubio-González, Aditya V. Thakur:
Interleaving Static Analysis and LLM Prompting. SOAP@PLDI 2024: 9-17 - [i12]Sameerah Helal, Zhe Tao, Cindy Rubio-González, François Gygi, Aditya V. Thakur:
Towards Verifying Exact Conditions of Density Functional Theory Approximations. CoRR abs/2408.05316 (2024) - 2023
- [j4]Zhe Tao, Stephanie Nawas, Jacqueline Mitchell, Aditya V. Thakur:
Architecture-Preserving Provable Repair of Deep Neural Networks. Proc. ACM Program. Lang. 7(PLDI): 443-467 (2023) - [j3]Matthew Sotoudeh, Zhe Tao, Aditya V. Thakur:
SyReNN: A tool for analyzing deep neural networks. Int. J. Softw. Tools Technol. Transf. 25(2): 145-165 (2023) - [i11]Zhe Tao, Stephanie Nawas, Jacqueline Mitchell, Aditya V. Thakur:
Architecture-Preserving Provable Repair of Deep Neural Networks. CoRR abs/2304.03496 (2023) - 2021
- [c28]Matthew Sotoudeh, Aditya V. Thakur:
Provable repair of deep neural networks. PLDI 2021: 588-603 - [c27]Matthew Sotoudeh, Aditya V. Thakur:
SyReNN: A Tool for Analyzing Deep Neural Networks. TACAS (2) 2021: 281-302 - [c26]Zhe Tao, Aseem Rastogi, Naman Gupta, Kapil Vaswani, Aditya V. Thakur:
DICE*: A Formally Verified Implementation of DICE Measured Boot. USENIX Security Symposium 2021: 1091-1107 - [i10]Matthew Sotoudeh, Aditya V. Thakur:
SyReNN: A Tool for Analyzing Deep Neural Networks. CoRR abs/2101.03263 (2021) - [i9]Matthew Sotoudeh, Aditya V. Thakur:
Provable Repair of Deep Neural Networks. CoRR abs/2104.04413 (2021) - 2020
- [j2]Sung Kook Kim, Arnaud J. Venet, Aditya V. Thakur:
Deterministic parallel fixpoint computation. Proc. ACM Program. Lang. 4(POPL): 14:1-14:33 (2020) - [c25]Gaurav R. Ghosal, Dipak Ghosal, Alex Sim, Aditya V. Thakur, Kesheng Wu:
A Deep Deterministic Policy Gradient Based Network Scheduler For Deadline-Driven Data Transfers. Networking 2020: 253-261 - [c24]Matthew Sotoudeh, Aditya V. Thakur:
Analogy-making as a Core primitive in the software engineering toolbox. Onward! 2020: 101-121 - [c23]Sung Kook Kim, Arnaud J. Venet, Aditya V. Thakur:
Memory-Efficient Fixpoint Computation. SAS 2020: 35-64 - [c22]Matthew Sotoudeh, Aditya V. Thakur:
Abstract Neural Networks. SAS 2020: 65-88 - [i8]Matthew Sotoudeh, Aditya V. Thakur:
Abstract Neural Networks. CoRR abs/2009.05660 (2020) - [i7]Sung Kook Kim, Arnaud J. Venet, Aditya V. Thakur:
Memory-Efficient Fixpoint Computation. CoRR abs/2009.05865 (2020) - [i6]Matthew Sotoudeh, Aditya V. Thakur:
Analogy-Making as a Core Primitive in the Software Engineering Toolbox. CoRR abs/2009.06592 (2020)
2010 – 2019
- 2019
- [c21]Dipak Ghosal, Sambit Shukla, Alex Sim, Aditya V. Thakur, Kesheng Wu:
A Reinforcement Learning Based Network Scheduler for Deadline-Driven Data Transfers. GLOBECOM 2019: 1-6 - [c20]Matthew Sotoudeh, Aditya V. Thakur:
Computing Linear Restrictions of Neural Networks. NeurIPS 2019: 14132-14143 - [c19]Daniel DeFreez, Haaken Martinson Baldwin, Cindy Rubio-González, Aditya V. Thakur:
Effective error-specification inference via domain-knowledge expansion. ESEC/SIGSOFT FSE 2019: 466-476 - [i5]Matthew Sotoudeh, Aditya V. Thakur:
Computing Linear Restrictions of Neural Networks. CoRR abs/1908.06214 (2019) - [i4]Matthew Sotoudeh, Aditya V. Thakur:
A Symbolic Neural Network Representation and its Application to Understanding, Verifying, and Patching Networks. CoRR abs/1908.06223 (2019) - [i3]Sung Kook Kim, Arnaud J. Venet, Aditya V. Thakur:
Deterministic Parallel Fixpoint Computation. CoRR abs/1909.05951 (2019) - 2018
- [c18]Daniel DeFreez, Aditya V. Thakur, Cindy Rubio-González:
Path-based function embeddings. ICSE (Companion Volume) 2018: 430-431 - [c17]Daniel DeFreez, Aditya V. Thakur, Cindy Rubio-González:
Path-based function embedding and its application to error-handling specification mining. ESEC/SIGSOFT FSE 2018: 423-433 - [i2]Daniel DeFreez, Aditya V. Thakur, Cindy Rubio-González:
Path-Based Function Embedding and its Application to Specification Mining. CoRR abs/1802.07779 (2018) - 2016
- [c16]Phitchaya Mangpo Phothilimthana, Aditya Thakur, Rastislav Bodík, Dinakar Dhurjati:
Scaling up Superoptimization. ASPLOS 2016: 297-310 - [c15]Phitchaya Mangpo Phothilimthana, Aditya Thakur, Rastislav Bodík, Dinakar Dhurjati:
GreenThumb: superoptimizer construction framework. CC 2016: 261-262 - [c14]Thomas W. Reps, Aditya V. Thakur:
Automating Abstract Interpretation. VMCAI 2016: 3-40 - 2014
- [c13]Shachar Itzhaky, Nikolaj S. Bjørner, Thomas W. Reps, Mooly Sagiv, Aditya V. Thakur:
Property-Directed Shape Analysis. CAV 2014: 35-51 - [c12]Aditya V. Thakur, Jason Breck, Thomas W. Reps:
Satisfiability modulo abstraction for separation logic with linked lists. SPIN 2014: 58-67 - [i1]Daniel Kroening, Thomas W. Reps, Sanjit A. Seshia, Aditya V. Thakur:
Decision Procedures and Abstract Interpretation (Dagstuhl Seminar 14351). Dagstuhl Reports 4(8): 89-106 (2014) - 2013
- [c11]Aditya V. Thakur, Akash Lal, Junghee Lim, Thomas W. Reps:
PostHat and All That: Automating Abstract Interpretation. TAPAS@SAS 2013: 15-32 - 2012
- [c10]Aditya V. Thakur, Thomas W. Reps:
A Method for Symbolic Computation of Abstract Operations. CAV 2012: 174-192 - [c9]Evan Driscoll, Aditya V. Thakur, Thomas W. Reps:
OpenNWA: A Nested-Word Automaton Library. CAV 2012: 665-671 - [c8]Aditya V. Thakur, Matt Elder, Thomas W. Reps:
Bilateral Algorithms for Symbolic Abstraction. SAS 2012: 111-128 - [c7]Aditya V. Thakur, Thomas W. Reps:
A Generalization of Stålmarck's Method. SAS 2012: 334-351 - 2010
- [j1]Nels E. Beckman, Aditya V. Nori, Sriram K. Rajamani, Robert J. Simmons, SaiDeep Tetali, Aditya V. Thakur:
Proofs from Tests. IEEE Trans. Software Eng. 36(4): 495-508 (2010) - [c6]Thomas W. Reps, Junghee Lim, Aditya V. Thakur, Gogul Balakrishnan, Akash Lal:
There's Plenty of Room at the Bottom: Analyzing and Verifying Machine Code. CAV 2010: 41-56 - [c5]Aditya V. Thakur, Junghee Lim, Akash Lal, Amanda Burton, Evan Driscoll, Matt Elder, Tycho Andersen, Thomas W. Reps:
Directed Proof Generation for Machine Code. CAV 2010: 288-305 - [c4]Guoliang Jin, Aditya V. Thakur, Ben Liblit, Shan Lu:
Instrumentation and sampling strategies for cooperative concurrency bug isolation. OOPSLA 2010: 241-255
2000 – 2009
- 2009
- [c3]Aditya V. Thakur, Rathijit Sen, Ben Liblit, Shan Lu:
Cooperative crug isolation. WODA 2009: 35-41 - [c2]Aditya V. Nori, Sriram K. Rajamani, SaiDeep Tetali, Aditya V. Thakur:
The YogiProject: Software Property Checking via Static Analysis and Testing. TACAS 2009: 178-181 - 2008
- [c1]Aditya V. Thakur, R. Govindarajan:
Comprehensive path-sensitive data-flow analysis. CGO 2008: 55-63
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
