Pavol Cerny

27 Publications

Mark all

[27]
2017 | Published | 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. Springer, pp. 97–139, 2017.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[26]
2015 | Published | Conference Paper | IST-REx-ID: 1729 | OA
P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.
[Submitted Version] View | Files available | DOI | WoS
 
[25]
2015 | Published | 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 | WoS
 
[24]
2013 | Published | 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
 
[23]
2013 | Published | 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.
[Submitted Version] View | Files available | DOI
 
[22]
2012 | Published | 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
 
[21]
2012 | Published | 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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[20]
2012 | Published | Journal Article | IST-REx-ID: 3249 | OA
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” Theoretical Computer Science, vol. 413, no. 1. Elsevier, pp. 21–35, 2012.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 
[19]
2012 | Published | Journal Article | IST-REx-ID: 2967
R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 3. ACM, 2012.
View | Files available | DOI | WoS
 
[18]
2011 | Published | Conference Paper | IST-REx-ID: 3359
P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.
View | DOI
 
[17]
2011 | Published | 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.
[Submitted Version] View | Files available | DOI
 
[16]
2011 | Published | Conference Paper | IST-REx-ID: 3361 | OA
P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
[Submitted Version] View | Files available | DOI | WoS
 
[15]
2011 | Published | Conference Paper | IST-REx-ID: 3325
R. Alur and P. Cerny, “Streaming transducers for algorithmic verification of single pass list processing programs,” presented at the POPL: Principles of Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.
View | DOI | WoS
 
[14]
2010 | Published | 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.
[Submitted Version] View | Files available | DOI
 
[13]
2010 | Published | 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.
[Published Version] View | Files available | DOI
 
[12]
2010 | Published | 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
 
[11]
2010 | Published | 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.
[Published Version] View | Files available | DOI
 
[10]
2010 | Published | 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.
[Submitted Version] View | Files available | DOI
 
[9]
2010 | Published | Technical Report | IST-REx-ID: 5389 | OA
P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances. IST Austria, 2010.
[Published Version] View | Files available | DOI
 
[8]
2010 | Published | Conference Paper | IST-REx-ID: 488 | OA
R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.
[Published Version] View | Files available | DOI | WoS
 
[7]
2009 | Published | Journal Article | IST-REx-ID: 4376
R. Lublinerman, S. Chaudhuri, and P. Cerny, “Parallel programming with object assemblies,” ACM SIGPLAN Notices, vol. 44, no. 10. ACM, pp. 61–80, 2009.
View | DOI
 
[6]
2009 | Published | Conference Paper | IST-REx-ID: 4391
P. Cerny and R. Alur, “Automated analysis of Java methods for confidentiality,” in 21st International Conference on Computer Aided Verification, 2009, vol. 5643, pp. 173–187.
View | DOI
 
[5]
2009 | Published | Conference Paper | IST-REx-ID: 4403 | OA
R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” presented at the CSL: Computer Science Logic, Coimbra, Portugal, 2009, vol. 5771, pp. 86–101.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2008 | Published | Conference Paper | IST-REx-ID: 4400 | OA
A. Aviv et al., “Security evaluation of ES&S voting machines and election management system,” in 17th USENIX Security Symposium, San Jose, CA, United States, 2008.
View | Download None (ext.)
 
[3]
2007 | Published | Conference Paper | IST-REx-ID: 4402
R. Alur, P. Cerny, and S. Chaudhuri, “Model checking on trees with path equivalences,” in 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Braga, Portugal, 2007, vol. 4424, pp. 664–678.
View | DOI
 
[2]
2006 | Published | Conference Paper | IST-REx-ID: 4401
R. Alur, P. Cerny, and S. Zdancewic, “Preserving secrecy under refinement,” in 33rd International Colloquium on Automata, Languages and Programming, 2006, vol. 4052, pp. 107–118.
View | DOI
 
[1]
2005 | Published | Conference Paper | IST-REx-ID: 4404
R. Alur, P. Cerny, P. Madhusudan, and W. Nam, “Synthesis of interface specifications for Java classes,” in Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Long Beach, CA, United States, 2005, pp. 98–109.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


27 Publications

Mark all

[27]
2017 | Published | 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. Springer, pp. 97–139, 2017.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[26]
2015 | Published | Conference Paper | IST-REx-ID: 1729 | OA
P. Cerny et al., “From non-preemptive to preemptive scheduling using synchronization synthesis,” vol. 9207. Springer, pp. 180–197, 2015.
[Submitted Version] View | Files available | DOI | WoS
 
[25]
2015 | Published | 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 | WoS
 
[24]
2013 | Published | 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
 
[23]
2013 | Published | 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.
[Submitted Version] View | Files available | DOI
 
[22]
2012 | Published | 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
 
[21]
2012 | Published | 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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[20]
2012 | Published | Journal Article | IST-REx-ID: 3249 | OA
P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” Theoretical Computer Science, vol. 413, no. 1. Elsevier, pp. 21–35, 2012.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS
 
[19]
2012 | Published | Journal Article | IST-REx-ID: 2967
R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 3. ACM, 2012.
View | Files available | DOI | WoS
 
[18]
2011 | Published | Conference Paper | IST-REx-ID: 3359
P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.
View | DOI
 
[17]
2011 | Published | 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.
[Submitted Version] View | Files available | DOI
 
[16]
2011 | Published | Conference Paper | IST-REx-ID: 3361 | OA
P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
[Submitted Version] View | Files available | DOI | WoS
 
[15]
2011 | Published | Conference Paper | IST-REx-ID: 3325
R. Alur and P. Cerny, “Streaming transducers for algorithmic verification of single pass list processing programs,” presented at the POPL: Principles of Programming Languages, Texas, USA, 2011, vol. 46, no. 1, pp. 599–610.
View | DOI | WoS
 
[14]
2010 | Published | 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.
[Submitted Version] View | Files available | DOI
 
[13]
2010 | Published | 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.
[Published Version] View | Files available | DOI
 
[12]
2010 | Published | 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
 
[11]
2010 | Published | 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.
[Published Version] View | Files available | DOI
 
[10]
2010 | Published | 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.
[Submitted Version] View | Files available | DOI
 
[9]
2010 | Published | Technical Report | IST-REx-ID: 5389 | OA
P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances. IST Austria, 2010.
[Published Version] View | Files available | DOI
 
[8]
2010 | Published | Conference Paper | IST-REx-ID: 488 | OA
R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.
[Published Version] View | Files available | DOI | WoS
 
[7]
2009 | Published | Journal Article | IST-REx-ID: 4376
R. Lublinerman, S. Chaudhuri, and P. Cerny, “Parallel programming with object assemblies,” ACM SIGPLAN Notices, vol. 44, no. 10. ACM, pp. 61–80, 2009.
View | DOI
 
[6]
2009 | Published | Conference Paper | IST-REx-ID: 4391
P. Cerny and R. Alur, “Automated analysis of Java methods for confidentiality,” in 21st International Conference on Computer Aided Verification, 2009, vol. 5643, pp. 173–187.
View | DOI
 
[5]
2009 | Published | Conference Paper | IST-REx-ID: 4403 | OA
R. Alur, P. Cerny, and S. Weinstein, “Algorithmic analysis of array-accessing programs,” presented at the CSL: Computer Science Logic, Coimbra, Portugal, 2009, vol. 5771, pp. 86–101.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2008 | Published | Conference Paper | IST-REx-ID: 4400 | OA
A. Aviv et al., “Security evaluation of ES&S voting machines and election management system,” in 17th USENIX Security Symposium, San Jose, CA, United States, 2008.
View | Download None (ext.)
 
[3]
2007 | Published | Conference Paper | IST-REx-ID: 4402
R. Alur, P. Cerny, and S. Chaudhuri, “Model checking on trees with path equivalences,” in 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Braga, Portugal, 2007, vol. 4424, pp. 664–678.
View | DOI
 
[2]
2006 | Published | Conference Paper | IST-REx-ID: 4401
R. Alur, P. Cerny, and S. Zdancewic, “Preserving secrecy under refinement,” in 33rd International Colloquium on Automata, Languages and Programming, 2006, vol. 4052, pp. 107–118.
View | DOI
 
[1]
2005 | Published | Conference Paper | IST-REx-ID: 4404
R. Alur, P. Cerny, P. Madhusudan, and W. Nam, “Synthesis of interface specifications for Java classes,” in Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Long Beach, CA, United States, 2005, pp. 98–109.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed