Most of the papers made available here also appear in print, and the corresponding copyright is held by the publisher. However, you are permitted to download the papers and use them for individual and classroom reading.

Several of the papers below are minor revisions of their print versions. Consequently, I urge you to use the versions from here as opposed to the corresponding print versions, whenever this is permitted.

Journals and conferences

2013

• Swarat Chaudhuri, Sriram Sankaranarayanan, and Moshe Vardi. Regular real analysis. 28th Symposium on Logic in Computer Science (LICS), 2013. (pdf)
  

• Roopsha Samanta, Jyotirmoy Deshmukh, and Swarat Chaudhuri. Robustness analysis of networked systems. Verification, Model Checking, and Abstract Interpretation (VMCAI), 2013. (pdf)
  

2012

• Swarat Chaudhuri, Sumit Gulwani, and Roberto Lublinerman. Continuity and robustness of programs. Communications of the ACM (CACM) Research Highlight, August 2012.  (html version)  (pdf)
  [Technical perspective by Andreas Zeller] 

• Swarat Chaudhuri and Armando Solar-Lezama. Euler: A System for Numerical Optimization of Programs. 24th International Conference on Computer-Aided Verification (CAV), 2012.   (pdf)

2011

• Rajeev Alur, Swarat Chaudhuri, and P. Madhusudan. Software model checking with languages of nested trees. ACM Transactions on Programming Languages and Systems (TOPLAS). Volume 33 Issue 5, November 2011.   (pdf)

• Roberto Lublinerman, Jisheng Zhao, Zoran Budimlic, Swarat Chaudhuri, and Vivek Sarkar. Delegated isolation. International Conference on Object Oriented Programming, Systems, Languages and Applications (OOPSLA), 2011.   (pdf)

• Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerman, and Sara Navidpour. Proving programs robust. Joint European Software Engineering Conference and ACM Symposium on the Foundations of Software Engineering (ESEC/FSE), 2011.   (pdf)
  [Winner of an ACM SIGSOFT Distinguished Paper Award; invited to Communications of the ACM (CACM) as a Research Highlight]

• Swarat Chaudhuri and Armando Solar-Lezama. Smoothing a program soundly and robustly. 23rd International Conference on Computer-Aided Verification (CAV), 2011.   (pdf)
  [Invited to the Journal of the ACM (JACM)]

• William Enck, Damien Octeau, Patrick McDaniel, and Swarat Chaudhuri. A study of Android application security. The 20th USENIX Security Symposium, 2011.   (pdf)

• Saurabh Srivastava, Sumit Gulwani, Swarat Chaudhuri, and Jeff Foster. Path-based inductive synthesis for program inversion. ACM Conference on Programming Language Design and Implementation (PLDI), 2011.   (pdf)

2010

• Pavol Cerny, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations. 22nd International Conference on Computer-Aided Verification (CAV), 2010.   (pdf)

• Swarat Chaudhuri and Armando Solar-Lezama. Smooth interpretation. ACM Conference on Programming Language Design and Implementation (PLDI), 2010.   (pdf)

• Swarat Chaudhuri, Sumit Gulwani, and Roberto Lublinerman. Continuity analysis of programs. 37th Annual Symposium on Principles of Programming Languages (POPL), 2010.   (pdf)

• Rajeev Alur and Swarat Chaudhuri. Temporal reasoning for procedural programs. The 11th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), 2010.   (pdf)

2009

• Roberto Lublinerman, Swarat Chaudhuri, and Pavol Cerny. Parallel programming with object assemblies. International Conference on Object Oriented Programming, Systems, Languages and Applications (OOPSLA), 2009. (pdf) (ppt)

• Chao Wang, Swarat Chaudhuri, Aarti Gupta, and Yu Yang. Symbolic Pruning of Concurrent Program Executions. Joint European Software Engineering Conference and ACM Symposium on the Foundations of Software Engineering (ESEC/FSE), 2009. (pdf)

2008

• Sriram Sankaranarayanan, Swarat Chaudhuri, Franjo Ivancic, Aarti Gupta. Dynamic inference of likely data preconditions over predicates by tree learning. International Symposium on Software Testing and Analysis (ISSTA), 2008. (pdf)

• Swarat Chaudhuri. Subcubic algorithms for recursive state machines. 35th Annual Symposium on Principles of Programming Languages (POPL), 2008. (pdf) (ps)

2007

• Rajeev Alur, Pavol Cerny, and Swarat Chaudhuri. Model checking on trees with path equivalences. 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2007. (pdf).

2006

• Rajeev Alur and Swarat Chaudhuri. Branching pushdown tree automata. 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2006. (pdf) (ps)

• Rajeev Alur, Swarat Chaudhuri, and P. Madhusudan. Languages of nested trees. 18th International Conference on Computer-Aided Verification (CAV), 2006. (pdf) (ps). Slides (ppt).

• Rajeev Alur, Swarat Chaudhuri, and P. Madhusudan. A fixpoint calculus for local and global program flows. 33rd Annual Symposium on Principles of Programming Languages (POPL), 2006. (pdf) (ps). Slides (ppt).

2005

• Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, and P. Madhusudan. On-the-fly reachability and cycle detection for recursive state machines. 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2005.

2003

• Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, and Mihalis Yannakakis. Compression of partially ordered strings. 14th International Conference on Concurrency Theory (CONCUR), 2003.

Workshops with published proceedings

2007

• Swarat Chaudhuri and Rajeev Alur. Instrumenting C programs with nested word monitors. 14th Workshop on Model Checking Software (SPIN), 2007. (pdf).

Survey

• Rajeev Alur and Swarat Chaudhuri. Logics and automata for software model-checking. Lecture notes, Marktoberdorf Summer School, 2006. (pdf) (ps)

Thesis

• Swarat Chaudhuri. Logics and algorithms for software model checking. Doctoral dissertation, University of Pennsylvania, 2007. [Winner of the ACM SIGPLAN Doctoral Dissertation Award, 2007, and the Maurice and Dorothy Rubinoff Award for the best computer science dissertation from the University of Pennsylvania.]