Soham Chakraborty

Orcid: 0000-0002-4454-2050

Affiliations:
  • TU Delft, The Netherlands
  • Indian Institute of Technology Delhi (IIT-Delhi), India (former)
  • Max Planck Institute for Software Systems, Kaiserslautern, Germany (former)
  • Kaiserslautern University of Technology, Department of Computer Science, Germany (PhD 2019)
  • Advanced Micro Devices (AMD), Bangalore, India (former)
  • IBM India Research Laboratory, New Delhi, India (former)


According to our database1, Soham Chakraborty authored at least 22 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
How Hard Is Weak-Memory Testing?
Proc. ACM Program. Lang., January, 2024

2023
Optimal Reads-From Consistency Checking for C11-Style Memory Models.
Proc. ACM Program. Lang., 2023

Compound Memory Models.
Proc. ACM Program. Lang., 2023

Risotto: A Dynamic Binary Translator for Weak Memory Model Architectures.
Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023

Probabilistic Concurrency Testing for Weak Memory Programs.
Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023

2022
Parameterized Verification under Release Acquire is PSPACE-complete.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Lasagne: a static binary translator for weak memory model architectures.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

2021
Robustness between Weak Memory Models.
Proceedings of the Formal Methods in Computer Aided Design, 2021

2020
On Architecture to Architecture Mapping for Concurrency.
CoRR, 2020

Promising 2.0: global optimizations in relaxed memory concurrency.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019
Correct Compilation of Relaxed Memory Concurrency.
PhD thesis, 2019

Grounding thin-air reads with event structures.
Proc. ACM Program. Lang., 2019

2017
Formalizing the concurrency semantics of an LLVM fragment.
Proceedings of the 2017 International Symposium on Code Generation and Optimization, 2017

2016
Validating optimizations of concurrent C/C++ programs.
Proceedings of the 2016 International Symposium on Code Generation and Optimization, 2016

Improved MHP Analysis.
Proceedings of the 25th International Conference on Compiler Construction, 2016

2015
Aspect-oriented linearizability proofs.
Log. Methods Comput. Sci., 2015

Common Compiler Optimisations are Invalid in the C11 Memory Model and what we can do about it.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

2011
Towards an approach and framework for test-execution plan derivation.
Proceedings of the 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011), 2011

2010
Inferring arbitrary distributions for data and computation.
Proceedings of the Companion to the 25th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2010

2009
Efficient Testing of Service-Oriented Applications Using Semantic Service Stubs.
Proceedings of the IEEE International Conference on Web Services, 2009

2008
Precise static type analysis in component based programming environment.
Proceedings of the Proceeding of the 1st Annual India Software Engineering Conference, 2008

2007
Precise static type analysis for object oriented programs.
ACM SIGPLAN Notices, 2007


  Loading...