21 Publications

Mark all

[21]
2017 | Journal Article | IST-REx-ID: 1338 | OA
P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” Formal Methods in System Design, vol. 50, no. 2–3, pp. 97–139, 2017.
View | Files available | DOI
 
[20]
2015 | Conference Paper | IST-REx-ID: 1729
P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.
View | Files available | DOI
 
[19]
2015 | Conference Paper | IST-REx-ID: 1836
P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr, “Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer, pp. 105–131, 2015.
View | DOI
 
[18]
2015 | Conference Paper | IST-REx-ID: 1992 | OA
A. Gupta, T. A. Henzinger, A. Radhakrishna, R. Samanta, and T. Tarrach, “Succinct representation of concurrent trace sets,” presented at the POPL: Principles of Programming Languages, Mumbai, India, 2015, pp. 433–444.
View | Files available | DOI
 
[17]
2014 | Journal Article | IST-REx-ID: 1733 | OA
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3, pp. 348–363, 2014.
View | Files available | DOI | Download Submitted Version (ext.)
 
[16]
2014 | Conference Paper | IST-REx-ID: 2218 | OA
P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free synthesis for concurrency,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 568–584.
View | Files available | DOI | Download Submitted Version (ext.)
 
[15]
2014 | Conference Paper | IST-REx-ID: 2239
U. Boker, T. A. Henzinger, and A. Radhakrishna, “Battery transition systems,” presented at the POPL: Principles of Programming Languages, San Diego, USA, 2014, vol. 49, no. 1, pp. 595–606.
View | DOI
 
[14]
2013 | Conference Paper | IST-REx-ID: 2182
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 115–128.
View | DOI
 
[13]
2013 | Conference Paper | IST-REx-ID: 2445 | OA
P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Efficient synthesis for concurrency by semantics-preserving transformations,” presented at the CAV: Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 951–967.
View | Files available | DOI
 
[12]
2012 | Conference Paper | IST-REx-ID: 2890
P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis from incompatible specifications,” in Proceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 53–62.
View | DOI
 
[11]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[10]
2012 | Journal Article | IST-REx-ID: 3249
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” Theoretical Computer Science, vol. 413, no. 1, pp. 21–35, 2012.
View | Files available | DOI
 
[9]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
View | Files available | DOI
 
[8]
2010 | Conference Paper | IST-REx-ID: 4388 | OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.
View | Files available | DOI | arXiv
 
[7]
2010 | Conference Paper | IST-REx-ID: 4390 | OA
P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, “Model checking of linearizability of concurrent list implementations,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 465–479.
View | Files available | DOI
 
[6]
2010 | Book Chapter | IST-REx-ID: 4392
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in Time For Verification: Essays in Memory of Amir Pnueli, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.
View | DOI
 
[5]
2010 | Conference Paper | IST-REx-ID: 4393 | OA
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.
View | Files available | DOI
 
[4]
2010 | Technical Report | IST-REx-ID: 5389 | OA
P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances. IST Austria, 2010.
View | Files available | DOI
 
[3]
2010 | Technical Report | IST-REx-ID: 5391 | OA
P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model checking of linearizability of concurrent list implementations. IST Austria, 2010.
View | Files available | DOI
 
[2]
2010 | Technical Report | IST-REx-ID: 5388 | OA
K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.
View | Files available | DOI
 
[1]
2009 | Technical Report | IST-REx-ID: 5393 | OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist: A solver for probabilistic games. IST Austria, 2009.
View | Files available | DOI
 

Search

Filter Publications

21 Publications

Mark all

[21]
2017 | Journal Article | IST-REx-ID: 1338 | OA
P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” Formal Methods in System Design, vol. 50, no. 2–3, pp. 97–139, 2017.
View | Files available | DOI
 
[20]
2015 | Conference Paper | IST-REx-ID: 1729
P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.
View | Files available | DOI
 
[19]
2015 | Conference Paper | IST-REx-ID: 1836
P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr, “Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer, pp. 105–131, 2015.
View | DOI
 
[18]
2015 | Conference Paper | IST-REx-ID: 1992 | OA
A. Gupta, T. A. Henzinger, A. Radhakrishna, R. Samanta, and T. Tarrach, “Succinct representation of concurrent trace sets,” presented at the POPL: Principles of Programming Languages, Mumbai, India, 2015, pp. 433–444.
View | Files available | DOI
 
[17]
2014 | Journal Article | IST-REx-ID: 1733 | OA
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3, pp. 348–363, 2014.
View | Files available | DOI | Download Submitted Version (ext.)
 
[16]
2014 | Conference Paper | IST-REx-ID: 2218 | OA
P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Regression-free synthesis for concurrency,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 568–584.
View | Files available | DOI | Download Submitted Version (ext.)
 
[15]
2014 | Conference Paper | IST-REx-ID: 2239
U. Boker, T. A. Henzinger, and A. Radhakrishna, “Battery transition systems,” presented at the POPL: Principles of Programming Languages, San Diego, USA, 2014, vol. 49, no. 1, pp. 595–606.
View | DOI
 
[14]
2013 | Conference Paper | IST-REx-ID: 2182
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative abstraction refinement,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 115–128.
View | DOI
 
[13]
2013 | Conference Paper | IST-REx-ID: 2445 | OA
P. Cerny, T. A. Henzinger, A. Radhakrishna, L. Ryzhyk, and T. Tarrach, “Efficient synthesis for concurrency by semantics-preserving transformations,” presented at the CAV: Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 951–967.
View | Files available | DOI
 
[12]
2012 | Conference Paper | IST-REx-ID: 2890
P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis from incompatible specifications,” in Proceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 53–62.
View | DOI
 
[11]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[10]
2012 | Journal Article | IST-REx-ID: 3249
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” Theoretical Computer Science, vol. 413, no. 1, pp. 21–35, 2012.
View | Files available | DOI
 
[9]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
View | Files available | DOI
 
[8]
2010 | Conference Paper | IST-REx-ID: 4388 | OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, “GIST: A solver for probabilistic games,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 665–669.
View | Files available | DOI | arXiv
 
[7]
2010 | Conference Paper | IST-REx-ID: 4390 | OA
P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, “Model checking of linearizability of concurrent list implementations,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 465–479.
View | Files available | DOI
 
[6]
2010 | Book Chapter | IST-REx-ID: 4392
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Quantitative Simulation Games,” in Time For Verification: Essays in Memory of Amir Pnueli, vol. 6200, Z. Manna and D. Peled, Eds. Springer, 2010, pp. 42–60.
View | DOI
 
[5]
2010 | Conference Paper | IST-REx-ID: 4393 | OA
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 235–268.
View | Files available | DOI
 
[4]
2010 | Technical Report | IST-REx-ID: 5389 | OA
P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances. IST Austria, 2010.
View | Files available | DOI
 
[3]
2010 | Technical Report | IST-REx-ID: 5391 | OA
P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model checking of linearizability of concurrent list implementations. IST Austria, 2010.
View | Files available | DOI
 
[2]
2010 | Technical Report | IST-REx-ID: 5388 | OA
K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.
View | Files available | DOI
 
[1]
2009 | Technical Report | IST-REx-ID: 5393 | OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist: A solver for probabilistic games. IST Austria, 2009.
View | Files available | DOI
 

Search

Filter Publications