Thorsten Tarrach
Henzinger_Thomas Group
6 Publications
2017 | Journal Article | IST-REx-ID: 1338 | 
Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Formal Methods in System Design. Springer, 2017. https://doi.org/10.1007/s10703-016-0256-5.
[Published Version]
View
| Files available
| DOI
| WoS
2016 | Thesis | IST-REx-ID: 1130 |
Tarrach, Thorsten. “Automatic Synthesis of Synchronisation Primitives for Concurrent Programs.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/at:ista:1130.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2015 | Conference Paper | IST-REx-ID: 1992 |
Gupta, Ashutosh, Thomas A Henzinger, Arjun Radhakrishna, Roopsha Samanta, and Thorsten Tarrach. “Succinct Representation of Concurrent Trace Sets,” 433–44. ACM, 2015. https://doi.org/10.1145/2676726.2677008.
[Submitted Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1729
Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-21668-3_11.
[Submitted Version]
View
| Files available
| DOI
2014 | Conference Paper | IST-REx-ID: 2218 |
Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,” 8559:568–84. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_38.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2013 | Conference Paper | IST-REx-ID: 2445 |
Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Efficient Synthesis for Concurrency by Semantics-Preserving Transformations,” 8044:951–67. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_68.
[Submitted Version]
View
| Files available
| DOI
6 Publications
2017 | Journal Article | IST-REx-ID: 1338 |
Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Formal Methods in System Design. Springer, 2017. https://doi.org/10.1007/s10703-016-0256-5.
[Published Version]
View
| Files available
| DOI
| WoS
2016 | Thesis | IST-REx-ID: 1130 |
Tarrach, Thorsten. “Automatic Synthesis of Synchronisation Primitives for Concurrent Programs.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/at:ista:1130.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2015 | Conference Paper | IST-REx-ID: 1992 |
Gupta, Ashutosh, Thomas A Henzinger, Arjun Radhakrishna, Roopsha Samanta, and Thorsten Tarrach. “Succinct Representation of Concurrent Trace Sets,” 433–44. ACM, 2015. https://doi.org/10.1145/2676726.2677008.
[Submitted Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1729
Cerny, Pavol, Edmund Clarke, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, and Thorsten Tarrach. “From Non-Preemptive to Preemptive Scheduling Using Synchronization Synthesis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-21668-3_11.
[Submitted Version]
View
| Files available
| DOI
2014 | Conference Paper | IST-REx-ID: 2218 |
Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Regression-Free Synthesis for Concurrency,” 8559:568–84. Springer, 2014. https://doi.org/10.1007/978-3-319-08867-9_38.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2013 | Conference Paper | IST-REx-ID: 2445 |
Cerny, Pavol, Thomas A Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, and Thorsten Tarrach. “Efficient Synthesis for Concurrency by Semantics-Preserving Transformations,” 8044:951–67. Springer, 2013. https://doi.org/10.1007/978-3-642-39799-8_68.
[Submitted Version]
View
| Files available
| DOI