Pavol Cerny

Henzinger_Thomas Group

27 Publications

Mark all

[27]
2017 | Journal Article | IST-REx-ID: 1338 | OA
Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2017). From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-016-0256-5
[Published Version] View | Files available | DOI | WoS
 
[26]
2015 | Conference Paper | IST-REx-ID: 1836
Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., & Zwirchmayr, J. (2015). Segment abstraction for worst-case execution time analysis. Presented at the ESOP: European Symposium on Programming, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46669-8_5
View | DOI
 
[25]
2015 | Conference Paper | IST-REx-ID: 1729
Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21668-3_11
[Submitted Version] View | Files available | DOI
 
[24]
2013 | Conference Paper | IST-REx-ID: 2182
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085
View | DOI
 
[23]
2013 | Conference Paper | IST-REx-ID: 2445 | OA
Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., & Tarrach, T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_68
[Submitted Version] View | Files available | DOI
 
[22]
2012 | Conference Paper | IST-REx-ID: 2890
Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., & Totla, N. (2012). Synthesis from incompatible specifications. In Proceedings of the tenth ACM international conference on Embedded software (pp. 53–62). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380371
View | DOI
 
[21]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[20]
2012 | Journal Article | IST-REx-ID: 2967
Alur, R., Cerny, P., & Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2287718.2287727
View | Files available | DOI
 
[19]
2012 | Journal Article | IST-REx-ID: 3249
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2012). Simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2011.08.002
View | Files available | DOI
 
[18]
2011 | Conference Paper | IST-REx-ID: 3325
Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454
View | DOI
 
[17]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
[Submitted Version] View | Files available | DOI
 
[16]
2011 | Conference Paper | IST-REx-ID: 3359
Cerny, P., & Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM. https://doi.org/10.1145/2038642.2038666
View | DOI
 
[15]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
[Submitted Version] View | Files available | DOI
 
[14]
2010 | Book Chapter | IST-REx-ID: 4392
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna & D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli (Vol. 6200, pp. 42–60). Springer. https://doi.org/10.1007/978-3-642-13754-9_3
View | DOI
 
[13]
2010 | Conference Paper | IST-REx-ID: 488 | OA
Alur, R., & Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1
[Published Version] View | Files available | DOI
 
[12]
2010 | Conference Paper | IST-REx-ID: 4393 | OA
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_18
[Submitted Version] View | Files available | DOI
 
[11]
2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004
[Published Version] View | Files available | DOI
 
[10]
2010 | Technical Report | IST-REx-ID: 5389 | OA
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances. IST Austria. https://doi.org/10.15479/AT:IST-2010-0003
[Published Version] View | Files available | DOI
 
[9]
2010 | Conference Paper | IST-REx-ID: 4390 | OA
Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010). Model checking of linearizability of concurrent list implementations (Vol. 6174, pp. 465–479). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_41
[Submitted Version] View | Files available | DOI
 
[8]
2010 | Technical Report | IST-REx-ID: 5391 | OA
Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010). Model checking of linearizability of concurrent list implementations. IST Austria. https://doi.org/10.15479/AT:IST-2010-0001
[Published Version] View | Files available | DOI
 
[7]
2009 | Conference Paper | IST-REx-ID: 4376
Lublinerman, R., Chaudhuri, S., & Cerny, P. (2009). Parallel programming with object assemblies (pp. 61–80). Presented at the Oopsla Object Oriented Programming Systems Languages and Applications, ACM. https://doi.org/1546
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4391
Cerny, P., & Alur, R. (2009). Automated Analysis of Java Methods for Confidentiality (pp. 173–187). Presented at the CAV: Computer Aided Verification, Springer. https://doi.org/1548
View | DOI
 
[5]
2009 | Conference Paper | IST-REx-ID: 4403 | OA
Alur, R., Cerny, P., & Weinstein, S. (2009). Algorithmic analysis of array-accessing programs (Vol. 5771, pp. 86–101). Presented at the CSL: Computer Science Logic, Coimbra, Portugal: Springer. https://doi.org/10.1007/978-3-642-04027-6_9
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2008 | Conference Paper | IST-REx-ID: 4400
Aviv, A., Cerny, P., Clark, S., Cronin, E., Shah, G., Sherr, M., & Blaze, M. (2008). Security Evaluation of ES&S Voting Machines and Election Management System. Presented at the Usenix/ Accurate Electronic Voting Technology Workshop (EVT) 08, USENIX. https://doi.org/1545
View | DOI | Download (ext.)
 
[3]
2007 | Conference Paper | IST-REx-ID: 4402
Alur, R., Cerny, P., & Chaudhuri, S. (2007). Model Checking on Trees with Path Equivalences (pp. 664–678). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/1544
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4401
Alur, R., Cerny, P., & Zdancewic, S. (2006). Preserving Secrecy Under Refinement (pp. 107–118). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/1543
View | DOI
 
[1]
2005 | Conference Paper | IST-REx-ID: 4404
Alur, R., Cerny, P., Madhusudan, P., & Nam, W. (2005). Synthesis of interface specifications for Java classes (pp. 98–109). Presented at the POPL: Principles of Programming Languages, ACM. https://doi.org/1542
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed

27 Publications

Mark all

[27]
2017 | Journal Article | IST-REx-ID: 1338 | OA
Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2017). From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-016-0256-5
[Published Version] View | Files available | DOI | WoS
 
[26]
2015 | Conference Paper | IST-REx-ID: 1836
Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., & Zwirchmayr, J. (2015). Segment abstraction for worst-case execution time analysis. Presented at the ESOP: European Symposium on Programming, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46669-8_5
View | DOI
 
[25]
2015 | Conference Paper | IST-REx-ID: 1729
Cerny, P., Clarke, E., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., Samanta, R., & Tarrach, T. (2015). From non-preemptive to preemptive scheduling using synchronization synthesis. Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21668-3_11
[Submitted Version] View | Files available | DOI
 
[24]
2013 | Conference Paper | IST-REx-ID: 2182
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2013). Quantitative abstraction refinement. In Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language (pp. 115–128). Rome, Italy: ACM. https://doi.org/10.1145/2429069.2429085
View | DOI
 
[23]
2013 | Conference Paper | IST-REx-ID: 2445 | OA
Cerny, P., Henzinger, T. A., Radhakrishna, A., Ryzhyk, L., & Tarrach, T. (2013). Efficient synthesis for concurrency by semantics-preserving transformations (Vol. 8044, pp. 951–967). Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer. https://doi.org/10.1007/978-3-642-39799-8_68
[Submitted Version] View | Files available | DOI
 
[22]
2012 | Conference Paper | IST-REx-ID: 2890
Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., & Totla, N. (2012). Synthesis from incompatible specifications. In Proceedings of the tenth ACM international conference on Embedded software (pp. 53–62). Tampere, Finland: ACM. https://doi.org/10.1145/2380356.2380371
View | DOI
 
[21]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. https://doi.org/10.4204/EPTCS.96.3
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[20]
2012 | Journal Article | IST-REx-ID: 2967
Alur, R., Cerny, P., & Weinstein, S. (2012). Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2287718.2287727
View | Files available | DOI
 
[19]
2012 | Journal Article | IST-REx-ID: 3249
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2012). Simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2011.08.002
View | Files available | DOI
 
[18]
2011 | Conference Paper | IST-REx-ID: 3325
Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454
View | DOI
 
[17]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
[Submitted Version] View | Files available | DOI
 
[16]
2011 | Conference Paper | IST-REx-ID: 3359
Cerny, P., & Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM. https://doi.org/10.1145/2038642.2038666
View | DOI
 
[15]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
[Submitted Version] View | Files available | DOI
 
[14]
2010 | Book Chapter | IST-REx-ID: 4392
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Quantitative Simulation Games. In Z. Manna & D. Peled (Eds.), Time For Verification: Essays in Memory of Amir Pnueli (Vol. 6200, pp. 42–60). Springer. https://doi.org/10.1007/978-3-642-13754-9_3
View | DOI
 
[13]
2010 | Conference Paper | IST-REx-ID: 488 | OA
Alur, R., & Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1
[Published Version] View | Files available | DOI
 
[12]
2010 | Conference Paper | IST-REx-ID: 4393 | OA
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances (Vol. 6269, pp. 235–268). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_18
[Submitted Version] View | Files available | DOI
 
[11]
2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004
[Published Version] View | Files available | DOI
 
[10]
2010 | Technical Report | IST-REx-ID: 5389 | OA
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances. IST Austria. https://doi.org/10.15479/AT:IST-2010-0003
[Published Version] View | Files available | DOI
 
[9]
2010 | Conference Paper | IST-REx-ID: 4390 | OA
Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010). Model checking of linearizability of concurrent list implementations (Vol. 6174, pp. 465–479). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer. https://doi.org/10.1007/978-3-642-14295-6_41
[Submitted Version] View | Files available | DOI
 
[8]
2010 | Technical Report | IST-REx-ID: 5391 | OA
Cerny, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., & Alur, R. (2010). Model checking of linearizability of concurrent list implementations. IST Austria. https://doi.org/10.15479/AT:IST-2010-0001
[Published Version] View | Files available | DOI
 
[7]
2009 | Conference Paper | IST-REx-ID: 4376
Lublinerman, R., Chaudhuri, S., & Cerny, P. (2009). Parallel programming with object assemblies (pp. 61–80). Presented at the Oopsla Object Oriented Programming Systems Languages and Applications, ACM. https://doi.org/1546
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4391
Cerny, P., & Alur, R. (2009). Automated Analysis of Java Methods for Confidentiality (pp. 173–187). Presented at the CAV: Computer Aided Verification, Springer. https://doi.org/1548
View | DOI
 
[5]
2009 | Conference Paper | IST-REx-ID: 4403 | OA
Alur, R., Cerny, P., & Weinstein, S. (2009). Algorithmic analysis of array-accessing programs (Vol. 5771, pp. 86–101). Presented at the CSL: Computer Science Logic, Coimbra, Portugal: Springer. https://doi.org/10.1007/978-3-642-04027-6_9
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[4]
2008 | Conference Paper | IST-REx-ID: 4400
Aviv, A., Cerny, P., Clark, S., Cronin, E., Shah, G., Sherr, M., & Blaze, M. (2008). Security Evaluation of ES&S Voting Machines and Election Management System. Presented at the Usenix/ Accurate Electronic Voting Technology Workshop (EVT) 08, USENIX. https://doi.org/1545
View | DOI | Download (ext.)
 
[3]
2007 | Conference Paper | IST-REx-ID: 4402
Alur, R., Cerny, P., & Chaudhuri, S. (2007). Model Checking on Trees with Path Equivalences (pp. 664–678). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. https://doi.org/1544
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4401
Alur, R., Cerny, P., & Zdancewic, S. (2006). Preserving Secrecy Under Refinement (pp. 107–118). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/1543
View | DOI
 
[1]
2005 | Conference Paper | IST-REx-ID: 4404
Alur, R., Cerny, P., Madhusudan, P., & Nam, W. (2005). Synthesis of interface specifications for Java classes (pp. 98–109). Presented at the POPL: Principles of Programming Languages, ACM. https://doi.org/1542
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: APA

    Export / Embed