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
출판물
-
-
-
-
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
-
Succinct Representation of Concurrent Trace Sets
Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, Thorsten Tarrach
Principles of Programming Languages (POPL) | January 2015
-
-
-
Regression-Free Synthesis for Concurrency
Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
Computer Aided Verification (CAV) | July 2014
-
-
-
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
-
-
-
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.
-
-
-
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
-
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
-
Succinct Representation of Concurrent Trace Sets
Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, Thorsten Tarrach
Principles of Programming Languages (POPL) | January 2015
-
Regression-Free Synthesis for Concurrency
Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
Computer Aided Verification (CAV) | July 2014
-
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
-
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.
-
-
-
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
-
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
-
Succinct Representation of Concurrent Trace Sets
Ashutosh Gupta, Thomas A. Henzinger, Arjun Radhakrishna, Roopsha Samanta, Thorsten Tarrach
Principles of Programming Languages (POPL) | January 2015
-
Regression-Free Synthesis for Concurrency
Pavol Cerny, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Thorsten Tarrach
Computer Aided Verification (CAV) | July 2014
-
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
-
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.
-
인원
Arjun Radhakrishna
Principal Researcher