Performance-aware Synthesis for Concurrency

Established: April 1, 2010

Publications

View by:

- From non-preemptive to preemptive scheduling using synchronization synthesis
  
  Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
  
  2017 Formal Methods | May 2017
  
  DOI
- From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis (2015)
  
  Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
  
  2015 Computer Aided Verification | July 2015
  
  PDF DOI
- Succinct Representation of Concurrent Trace Sets
  
  Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, Thorsten Tarrach
  
  Principles of Programming Languages (POPL) | January 2015
  
  PDF Publication DOI
- Regression-Free Synthesis for Concurrency
  
  Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
  
  Computer Aided Verification (CAV) | July 2014
  
  PDF Publication DOI
- Efficient Synthesis for Concurrency by Semantics-Preserving Transformations
  
  Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
  
  Computer Aided Verification (CAV) | July 2013
  
  PDF Publication DOI
- Quantitative Synthesis for Concurrent Programs
  
  Pavol Cerny, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna, Rohit Singh
  
  Computer Aided Verification (CAV) | July 2011
  
  Errata: The synthesis problem is PSPACE-complete, rather than NEXP-complete as claimed. However, the message that the problem is computationally hard still stands.
  
  PDF Publication DOI

- From non-preemptive to preemptive scheduling using synchronization synthesis
  
  Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
  
  2017 Formal Methods | May 2017
  
  DOI
- From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis (2015)
  
  Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
  
  2015 Computer Aided Verification | July 2015
  
  PDF DOI
- Succinct Representation of Concurrent Trace Sets
  
  Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, Thorsten Tarrach
  
  Principles of Programming Languages (POPL) | January 2015
  
  PDF Publication DOI
- Regression-Free Synthesis for Concurrency
  
  Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
  
  Computer Aided Verification (CAV) | July 2014
  
  PDF Publication DOI
- Efficient Synthesis for Concurrency by Semantics-Preserving Transformations
  
  Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
  
  Computer Aided Verification (CAV) | July 2013
  
  PDF Publication DOI
- Quantitative Synthesis for Concurrent Programs
  
  Pavol Cerny, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna, Rohit Singh
  
  Computer Aided Verification (CAV) | July 2011
  
  Errata: The synthesis problem is PSPACE-complete, rather than NEXP-complete as claimed. However, the message that the problem is computationally hard still stands.
  
  PDF Publication DOI

- From non-preemptive to preemptive scheduling using synchronization synthesis
  
  Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
  
  2017 Formal Methods | May 2017
  
  DOI
- From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis (2015)
  
  Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
  
  2015 Computer Aided Verification | July 2015
  
  PDF DOI
- Succinct Representation of Concurrent Trace Sets
  
  Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, Thorsten Tarrach
  
  Principles of Programming Languages (POPL) | January 2015
  
  PDF Publication DOI
- Regression-Free Synthesis for Concurrency
  
  Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
  
  Computer Aided Verification (CAV) | July 2014
  
  PDF Publication DOI
- Efficient Synthesis for Concurrency by Semantics-Preserving Transformations
  
  Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
  
  Computer Aided Verification (CAV) | July 2013
  
  PDF Publication DOI
- Quantitative Synthesis for Concurrent Programs
  
  Pavol Cerny, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna, Rohit Singh
  
  Computer Aided Verification (CAV) | July 2011
  
  Errata: The synthesis problem is PSPACE-complete, rather than NEXP-complete as claimed. However, the message that the problem is computationally hard still stands.
  
  PDF Publication DOI

People

Arjun Radhakrishna

Principal Researcher

Learn more