Pavol Cerny

Henzinger_Thomas Group

27 Publications

Mark all

[27]
2017 | Journal Article | IST-REx-ID: 1338 | OA
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
 
[26]
2015 | Conference Paper | IST-REx-ID: 1836
Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46669-8_5.
View | DOI
 
[25]
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
 
[24]
2013 | Conference Paper | IST-REx-ID: 2182
Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085.
View | DOI
 
[23]
2013 | Conference Paper | IST-REx-ID: 2445 | OA
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
 
[22]
2012 | Conference Paper | IST-REx-ID: 2890
Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.” In Proceedings of the Tenth ACM International Conference on Embedded Software, 53–62. ACM, 2012. https://doi.org/10.1145/2380356.2380371.
View | DOI
 
[21]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012. 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, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.” ACM Transactions on Computational Logic (TOCL). ACM, 2012. https://doi.org/10.1145/2287718.2287727.
View | Files available | DOI
 
[19]
2012 | Journal Article | IST-REx-ID: 3249
Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2011.08.002.
View | Files available | DOI
 
[18]
2011 | Conference Paper | IST-REx-ID: 3325
Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,” 46:599–610. ACM, 2011. https://doi.org/10.1145/1926385.1926454.
View | DOI
 
[17]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. https://doi.org/10.1109/CSF.2011.21.
[Submitted Version] View | Files available | DOI
 
[16]
2011 | Conference Paper | IST-REx-ID: 3359
Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,” 149–54. ACM, 2011. https://doi.org/10.1145/2038642.2038666.
View | DOI
 
[15]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. 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, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.” In Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. https://doi.org/10.1007/978-3-642-13754-9_3.
View | DOI
 
[13]
2010 | Conference Paper | IST-REx-ID: 488 | OA
Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. 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, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. 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, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010. 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, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. Simulation Distances. IST Austria, 2010. 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, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,” 6174:465–79. Springer, 2010. 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, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0001.
[Published Version] View | Files available | DOI
 
[7]
2009 | Conference Paper | IST-REx-ID: 4376
Lublinerman, Roberto, Swarat Chaudhuri, and Pavol Cerny. “Parallel Programming with Object Assemblies,” 61–80. ACM, 2009. https://doi.org/1546.
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4391
Cerny, Pavol, and Rajeev Alur. “Automated Analysis of Java Methods for Confidentiality,” 173–87. Springer, 2009. https://doi.org/1548.
View | DOI
 
[5]
2009 | Conference Paper | IST-REx-ID: 4403 | OA
Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs,” 5771:86–101. Springer, 2009. 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, Adam, Pavol Cerny, Sandy Clark, Eric Cronin, Gaurav Shah, Micah Sherr, and Matt Blaze. “Security Evaluation of ES&S Voting Machines and Election Management System.” USENIX, 2008. https://doi.org/1545.
View | DOI | Download (ext.)
 
[3]
2007 | Conference Paper | IST-REx-ID: 4402
Alur, Rajeev, Pavol Cerny, and Swarat Chaudhuri. “Model Checking on Trees with Path Equivalences,” 664–78. Springer, 2007. https://doi.org/1544.
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4401
Alur, Rajeev, Pavol Cerny, and Steve Zdancewic. “Preserving Secrecy Under Refinement,” 107–18. Springer, 2006. https://doi.org/1543.
View | DOI
 
[1]
2005 | Conference Paper | IST-REx-ID: 4404
Alur, Rajeev, Pavol Cerny, P. Madhusudan, and Wonhong Nam. “Synthesis of Interface Specifications for Java Classes,” 98–109. ACM, 2005. https://doi.org/1542.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed

27 Publications

Mark all

[27]
2017 | Journal Article | IST-REx-ID: 1338 | OA
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
 
[26]
2015 | Conference Paper | IST-REx-ID: 1836
Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46669-8_5.
View | DOI
 
[25]
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
 
[24]
2013 | Conference Paper | IST-REx-ID: 2182
Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Abstraction Refinement.” In Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, 115–28. ACM, 2013. https://doi.org/10.1145/2429069.2429085.
View | DOI
 
[23]
2013 | Conference Paper | IST-REx-ID: 2445 | OA
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
 
[22]
2012 | Conference Paper | IST-REx-ID: 2890
Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.” In Proceedings of the Tenth ACM International Conference on Embedded Software, 53–62. ACM, 2012. https://doi.org/10.1145/2380356.2380371.
View | DOI
 
[21]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012. 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, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs.” ACM Transactions on Computational Logic (TOCL). ACM, 2012. https://doi.org/10.1145/2287718.2287727.
View | Files available | DOI
 
[19]
2012 | Journal Article | IST-REx-ID: 3249
Cerny, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2011.08.002.
View | Files available | DOI
 
[18]
2011 | Conference Paper | IST-REx-ID: 3325
Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,” 46:599–610. ACM, 2011. https://doi.org/10.1145/1926385.1926454.
View | DOI
 
[17]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. https://doi.org/10.1109/CSF.2011.21.
[Submitted Version] View | Files available | DOI
 
[16]
2011 | Conference Paper | IST-REx-ID: 3359
Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,” 149–54. ACM, 2011. https://doi.org/10.1145/2038642.2038666.
View | DOI
 
[15]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. 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, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Quantitative Simulation Games.” In Time For Verification: Essays in Memory of Amir Pnueli, edited by Zohar Manna and Doron Peled, 6200:42–60. Essays in Memory of Amir Pnueli. Springer, 2010. https://doi.org/10.1007/978-3-642-13754-9_3.
View | DOI
 
[13]
2010 | Conference Paper | IST-REx-ID: 488 | OA
Alur, Rajeev, and Pavol Cerny. “Expressiveness of Streaming String Transducers,” 8:1–12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. 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, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. “Simulation Distances,” 6269:235–68. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010. 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, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010. 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, Pavol, Thomas A Henzinger, and Arjun Radhakrishna. Simulation Distances. IST Austria, 2010. 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, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. “Model Checking of Linearizability of Concurrent List Implementations,” 6174:465–79. Springer, 2010. 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, Pavol, Arjun Radhakrishna, Damien Zufferey, Swarat Chaudhuri, and Rajeev Alur. Model Checking of Linearizability of Concurrent List Implementations. IST Austria, 2010. https://doi.org/10.15479/AT:IST-2010-0001.
[Published Version] View | Files available | DOI
 
[7]
2009 | Conference Paper | IST-REx-ID: 4376
Lublinerman, Roberto, Swarat Chaudhuri, and Pavol Cerny. “Parallel Programming with Object Assemblies,” 61–80. ACM, 2009. https://doi.org/1546.
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4391
Cerny, Pavol, and Rajeev Alur. “Automated Analysis of Java Methods for Confidentiality,” 173–87. Springer, 2009. https://doi.org/1548.
View | DOI
 
[5]
2009 | Conference Paper | IST-REx-ID: 4403 | OA
Alur, Rajeev, Pavol Cerny, and Scott Weinstein. “Algorithmic Analysis of Array-Accessing Programs,” 5771:86–101. Springer, 2009. 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, Adam, Pavol Cerny, Sandy Clark, Eric Cronin, Gaurav Shah, Micah Sherr, and Matt Blaze. “Security Evaluation of ES&S Voting Machines and Election Management System.” USENIX, 2008. https://doi.org/1545.
View | DOI | Download (ext.)
 
[3]
2007 | Conference Paper | IST-REx-ID: 4402
Alur, Rajeev, Pavol Cerny, and Swarat Chaudhuri. “Model Checking on Trees with Path Equivalences,” 664–78. Springer, 2007. https://doi.org/1544.
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4401
Alur, Rajeev, Pavol Cerny, and Steve Zdancewic. “Preserving Secrecy Under Refinement,” 107–18. Springer, 2006. https://doi.org/1543.
View | DOI
 
[1]
2005 | Conference Paper | IST-REx-ID: 4404
Alur, Rajeev, Pavol Cerny, P. Madhusudan, and Wonhong Nam. “Synthesis of Interface Specifications for Java Classes,” 98–109. ACM, 2005. https://doi.org/1542.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed