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
Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
2017 Formal Methods | May 2017
Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
2015 Computer Aided Verification | July 2015
Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, Thorsten Tarrach
Principles of Programming Languages (POPL) | January 2015
Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
Computer Aided Verification (CAV) | July 2014
Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
Computer Aided Verification (CAV) | July 2013
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.
Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
2017 Formal Methods | May 2017
Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
2015 Computer Aided Verification | July 2015
Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, Thorsten Tarrach
Principles of Programming Languages (POPL) | January 2015
Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
Computer Aided Verification (CAV) | July 2014
Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
Computer Aided Verification (CAV) | July 2013
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.
Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
2017 Formal Methods | May 2017
Pavol Cerny, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
2015 Computer Aided Verification | July 2015
Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, Thorsten Tarrach
Principles of Programming Languages (POPL) | January 2015
Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
Computer Aided Verification (CAV) | July 2014
Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
Computer Aided Verification (CAV) | July 2013
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.
Principal Researcher