default search action
Soham Chakraborty 0001
Person information
- affiliation: TU Delft, The Netherlands
- affiliation (former): Indian Institute of Technology Delhi (IIT-Delhi), India
- affiliation (former): Max Planck Institute for Software Systems, Kaiserslautern, Germany
- affiliation (PhD 2019): Kaiserslautern University of Technology, Department of Computer Science, Germany
- affiliation (former): Advanced Micro Devices (AMD), Bangalore, India
- affiliation (former): IBM India Research Laboratory, New Delhi, India
Other persons with the same name
- Soham Chakraborty 0002 — University of Kentucky, Department of Computer Science, Lexington, KY, USA
- Soham Chakraborty 0003
— University of Minnesota, Department of Electrical and Computer Engineering, Minneapolis, MN, USA (and 1 more)
- Soham Chakraborty 0004 — KIIT, Bhubaneshwar, India
- Soham Chakraborty 0005
- Soham Chakraborty 0006
- Soham Chakraborty 0007
- Soham Chakraborty 0008 — Jadavpur University, Kolkata, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Soham Chakraborty
How Hard Is Weak-Memory Testing? Proc. ACM Program. Lang. 8(POPL): 1978-2009 (2024) - [c15]Maurice Bailleu
Toast: A Heterogeneous Memory Management System. PACT 2024: 53-65 - [i4]Martin Fink, Dimitrios Stavrakakis, Dennis Sprokholt, Soham Chakraborty, Jan-Erik Ekberg, Pramod Bhatotia:
Cage: Hardware-Accelerated Safe WebAssembly. CoRR abs/2408.11456 (2024) - 2023
- [j5]Hünkar Can Tunç
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Proc. ACM Program. Lang. 7(PLDI): 761-785 (2023) - [j4]Andrés Goens
Compound Memory Models. Proc. ACM Program. Lang. 7(PLDI): 1145-1168 (2023) - [c14]Redha Gouicem, Dennis Sprokholt, Jasper Ruehl, Rodrigo C. O. Rocha, Tom Spink
Risotto: A Dynamic Binary Translator for Weak Memory Model Architectures. ASPLOS (1) 2023: 107-122 - [c13]Mingyu Gao, Soham Chakraborty, Burcu Kulahcioglu Ozkan
Probabilistic Concurrency Testing for Weak Memory Programs. ASPLOS (2) 2023: 603-616 - [d2]Hünkar Can Tunç
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Version 2. Zenodo, 2023 [all versions] - [d1]Hünkar Can Tunç
Optimal Reads-From Consistency Checking for C11-Style Memory Models. Version 5. Zenodo, 2023 [all versions] - [i3]Parosh Aziz Abdulla, Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç:
Optimal Reads-From Consistency Checking for C11-Style Memory Models. CoRR abs/2304.03714 (2023) - [i2]Soham Chakraborty, Shankaranarayanan Krishna, Umang Mathur, Andreas Pavlogiannis:
How Hard is Weak-Memory Testing? CoRR abs/2311.04302 (2023) - 2022
- [c12]Rodrigo C. O. Rocha, Dennis Sprokholt, Martin Fink
Lasagne: a static binary translator for weak memory model architectures. PLDI 2022: 888-902 - [c11]Shankaranarayanan Krishna, Adwait Godbole, Roland Meyer, Soham Chakraborty:
Parameterized Verification under Release Acquire is PSPACE-complete. PODC 2022: 482-492 - 2021
- [c10]Soham Chakraborty:
Robustness between Weak Memory Models. FMCAD 2021: 173-182 - 2020
- [c9]Sung-Hwan Lee
Promising 2.0: global optimizations in relaxed memory concurrency. PLDI 2020: 362-376 - [i1]Soham Chakraborty:
On Architecture to Architecture Mapping for Concurrency. CoRR abs/2009.03846 (2020)
2010 – 2019
- 2019
- [b1]Soham Chakraborty:
Correct Compilation of Relaxed Memory Concurrency. Kaiserslautern University of Technology, Germany, 2019 - [j3]Soham Chakraborty, Viktor Vafeiadis
Grounding thin-air reads with event structures. Proc. ACM Program. Lang. 3(POPL): 70:1-70:28 (2019) - 2017
- [c8]Soham Chakraborty, Viktor Vafeiadis:
Formalizing the concurrency semantics of an LLVM fragment. CGO 2017: 100-110 - 2016
- [c7]Aravind Sankar, Soham Chakraborty, V. Krishna Nandivada
Improved MHP Analysis. CC 2016: 207-217 - [c6]Soham Chakraborty, Viktor Vafeiadis
Validating optimizations of concurrent C/C++ programs. CGO 2016: 216-226 - 2015
- [j2]Soham Chakraborty, Thomas A. Henzinger, Ali Sezgin, Viktor Vafeiadis
Aspect-oriented linearizability proofs. Log. Methods Comput. Sci. 11(1) (2015) - [c5]Viktor Vafeiadis
Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it. POPL 2015: 209-220 - 2011
- [c4]Soham Sundar Chakraborty, Vipul Shah:
Towards an approach and framework for test-execution plan derivation. ASE 2011: 488-491 - 2010
- [c3]Soham Sundar Chakraborty, V. Krishna Nandivada
Inferring arbitrary distributions for data and computation. SPLASH/OOPSLA Companion 2010: 51-60
2000 – 2009
- 2009
- [c2]Senthil Mani, Vibha Singhal Sinha, Saurabh Sinha, Pankaj Dhoolia, Debdoot Mukherjee, Soham Chakraborty:
Efficient Testing of Service-Oriented Applications Using Semantic Service Stubs. ICWS 2009: 197-204 - 2008
- [c1]Soham Sundar Chakraborty, Rajeev Kumar:
Precise static type analysis in component based programming environment. ISEC 2008: 133-134 - 2007
- [j1]Rajeev Kumar, Soham Sundar Chakraborty:
Precise static type analysis for object oriented programs. ACM SIGPLAN Notices 42(2): 17-26 (2007)
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-12-13 19:14 CET 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: