Saurabh Joshi bio photo

Saurabh Joshi

Assistant Professor, Department of CSE, Academic Block C, Cabin:312/F, IIT Hyderabad, Kandi, Sangareddy, Telangana- 502285, India

Email Google Scholar Github Orcid


Peer-reviewed articles

With :
  1. Prateek Kumar, Sukrut Rao, and Ruben Martins, “Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT”, Journal of Satisfiability, Boolean Modelling and Computation (JSAT) (accepted) [paper]

  2. Yash Pote and Kuldeep Singh Meel,“Phase Transition Behavior of Cardinality and XOR Constraints”, IJCAI 2019 (accepted) [pre-print].

  3. Eti Chaudhary, “Pinaka: Symbolic Execution meets Incremental Solving (Competition Contribution)”, SVCOMP 2019, TOOLympics (TACAS 2019). [arXiv]

  4. Prateek Kumar, Ruben Martins, and Sukrut Rao, “Approximation Strategies for Incomplete MaxSAT”, 24th International Conference on Principles and Practice of Constraint Programming (CP) 2018. [arXiv]

  5. Subramaniam Kalyanasundaram, Anjaneya Swami Kare, and Bhyravarapu Sriram, “On the Tractability of (k,i)-coloring”, (CALDAM) 2018. [arXiv]

  6. Vojtech Forejt, Daniel Kroening, Ganesh Narayanaswamy and Subodh Sharma, “Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs”, (TOPLAS) 2017. [pre-print]

  7. Rajdeep Mukherjee, Andreas Griesmayer, Daniel Kroening and Tom Melham, “Equivalence Checking of a Floating-point Unit Against a High-level C Model” (FM) 2016. [arXiv]

  8. Ganesh Narayanaswamy and Daniel Kroening, “The Virtues of Conflict: Analysing Modern Concurrency”, 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) 2016. [arXiv]

  9. Ruben Martins, Vasco Manquinho and Ines Lynce,“On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving”, Journal of Satisfiability, Boolean Modelling and Computation (JSAT), Vol.9, pp.59-81, 2015. [paper]

  10. Martin Brain, Daniel Kroening and Peter Schrammel, “Safety Verification and Refutation by k-invariants and k-induction”, 22nd International Static Analysis Symposium (SAS) 2015. [arXiv]

  11. Ruben Martins and Vasco Manquinho, “Generalized Totalizer Encoding for Pseudo-Boolean Constraints”, 21st International Conference on Principles and Practice of Constraint Programming (CP) 2015. [arXiv]

  12. Daniel Kroening, “Property Driven Fence Insertion using Reorder Bounded Model Checking”, 20th Inernational Symposium on Formal Methods (FM) 2015. [arXiv]

  13. Ruben Martins, Vasco Marquinho and Ines Lynce, “Incremental Cardinality Constraints for MaxSAT”, 20th International Conference on Principles and Practice of Constraint Programming (CP) 2014. [arXiv]

  14. R K Shyamasundar and Sanjeev Aggarwal,“A New Method of MHP Analysis for Languages with Dynamic Barriers”, 17th International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS) 2012.

  15. Shuvendu K. Lahiri and Akash Lal, “Underspecified Harness and Interleaved Bugs”, Symposium on Principles of Programming Languages (POPL) 2012.

  16. Shivali Agarwal and R K Shyamasundar, “Distributed Generalized Dynamic Barrier Synchronization”, International Conference on Distributed Computing and Networking (ICDCN) 2011.

  17. Frederic Doucet, R.K. Shyamasundar, Ingolf H. Krueger and Rajesh K. Gupta, “Reactivity in SystemC Transaction-Level Models”, Haifa Verification Conference (HVC) 2007.

With :
  1. Ruben Martins, Vasco Manquinho, and Ines Lynce, “Reflections on ““Incremental Cardinality Constraints for MaxSAT”” “, Invited article for the Virtual Volume created to celebrate 25 years of CP. [arXiv]

  2. Akash Lal, “Automatically finding atomic regions for fixing bugs in Concurrent programs”, 2014. [arXiv]