27 Publications

Mark all

[27]
2017 | Journal Article | IST-REx-ID: 1338 | OA
Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2017. From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. 50(2–3), 97–139.
[Published Version] View | Files available | DOI | WoS
 
[26]
2015 | Conference Paper | IST-REx-ID: 1836
Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. 2015. Segment abstraction for worst-case execution time analysis. 9032, 105–131.
View | DOI
 
[25]
2015 | Conference Paper | IST-REx-ID: 1729
Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis. 9207, 180–197.
[Submitted Version] View | Files available | DOI
 
[24]
2013 | Conference Paper | IST-REx-ID: 2182
Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.
View | DOI
 
[23]
2013 | Conference Paper | IST-REx-ID: 2445 | OA
Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2013. Efficient synthesis for concurrency by semantics-preserving transformations. CAV: Computer Aided Verification, LNCS, vol. 8044, 951–967.
[Submitted Version] View | Files available | DOI
 
[22]
2012 | Conference Paper | IST-REx-ID: 2890
Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from incompatible specifications. Proceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 53–62.
View | DOI
 
[21]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42.
[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). 13(3), 27.
View | Files available | DOI
 
[19]
2012 | Journal Article | IST-REx-ID: 3249
Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.
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. POPL: Principles of Programming Languages vol. 46, 599–610.
View | DOI
 
[17]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
[Submitted Version] View | Files available | DOI
 
[16]
2011 | Conference Paper | IST-REx-ID: 3359
Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.
View | DOI
 
[15]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.
[Submitted Version] View | Files available | DOI
 
[14]
2010 | Book Chapter | IST-REx-ID: 4392
Cerny P, Henzinger TA, Radhakrishna A. 2010.Quantitative Simulation Games. In: Time For Verification: Essays in Memory of Amir Pnueli. LNCS, vol. 6200, 42–60.
View | DOI
 
[13]
2010 | Conference Paper | IST-REx-ID: 488 | OA
Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12.
[Published Version] View | Files available | DOI
 
[12]
2010 | Conference Paper | IST-REx-ID: 4393 | OA
Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.
[Submitted Version] View | Files available | DOI
 
[11]
2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
[Published Version] View | Files available | DOI
 
[10]
2010 | Technical Report | IST-REx-ID: 5389 | OA
Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p.
[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. CAV: Computer Aided Verification, LNCS, vol. 6174, 465–479.
[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, 27p.
[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. Oopsla Object Oriented Programming Systems Languages and Applications, 61–80.
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4391
Cerny P, Alur R. 2009. Automated Analysis of Java Methods for Confidentiality. CAV: Computer Aided Verification, LNCS, , 173–187.
View | DOI
 
[5]
2009 | Conference Paper | IST-REx-ID: 4403 | OA
Alur R, Cerny P, Weinstein S. 2009. Algorithmic analysis of array-accessing programs. CSL: Computer Science Logic, LNCS, vol. 5771, 86–101.
[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. Usenix/ Accurate Electronic Voting Technology Workshop (EVT) 08.
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. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, , 664–678.
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4401
Alur R, Cerny P, Zdancewic S. 2006. Preserving Secrecy Under Refinement. ICALP: Automata, Languages and Programming, LNCS, , 107–118.
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. POPL: Principles of Programming Languages, 98–109.
View | DOI
 

Search

Filter Publications

27 Publications

Mark all

[27]
2017 | Journal Article | IST-REx-ID: 1338 | OA
Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2017. From non-preemptive to preemptive scheduling using synchronization synthesis. Formal Methods in System Design. 50(2–3), 97–139.
[Published Version] View | Files available | DOI | WoS
 
[26]
2015 | Conference Paper | IST-REx-ID: 1836
Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. 2015. Segment abstraction for worst-case execution time analysis. 9032, 105–131.
View | DOI
 
[25]
2015 | Conference Paper | IST-REx-ID: 1729
Cerny P, Clarke E, Henzinger TA, Radhakrishna A, Ryzhyk L, Samanta R, Tarrach T. 2015. From non-preemptive to preemptive scheduling using synchronization synthesis. 9207, 180–197.
[Submitted Version] View | Files available | DOI
 
[24]
2013 | Conference Paper | IST-REx-ID: 2182
Cerny P, Henzinger TA, Radhakrishna A. 2013. Quantitative abstraction refinement. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 115–128.
View | DOI
 
[23]
2013 | Conference Paper | IST-REx-ID: 2445 | OA
Cerny P, Henzinger TA, Radhakrishna A, Ryzhyk L, Tarrach T. 2013. Efficient synthesis for concurrency by semantics-preserving transformations. CAV: Computer Aided Verification, LNCS, vol. 8044, 951–967.
[Submitted Version] View | Files available | DOI
 
[22]
2012 | Conference Paper | IST-REx-ID: 2890
Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from incompatible specifications. Proceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 53–62.
View | DOI
 
[21]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42.
[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). 13(3), 27.
View | Files available | DOI
 
[19]
2012 | Journal Article | IST-REx-ID: 3249
Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.
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. POPL: Principles of Programming Languages vol. 46, 599–610.
View | DOI
 
[17]
2011 | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
[Submitted Version] View | Files available | DOI
 
[16]
2011 | Conference Paper | IST-REx-ID: 3359
Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT: Embedded Software , 149–154.
View | DOI
 
[15]
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.
[Submitted Version] View | Files available | DOI
 
[14]
2010 | Book Chapter | IST-REx-ID: 4392
Cerny P, Henzinger TA, Radhakrishna A. 2010.Quantitative Simulation Games. In: Time For Verification: Essays in Memory of Amir Pnueli. LNCS, vol. 6200, 42–60.
View | DOI
 
[13]
2010 | Conference Paper | IST-REx-ID: 488 | OA
Alur R, Cerny P. 2010. Expressiveness of streaming string transducers. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 1–12.
[Published Version] View | Files available | DOI
 
[12]
2010 | Conference Paper | IST-REx-ID: 4393 | OA
Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances. CONCUR: Concurrency Theory, LNCS, vol. 6269, 235–268.
[Submitted Version] View | Files available | DOI
 
[11]
2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
[Published Version] View | Files available | DOI
 
[10]
2010 | Technical Report | IST-REx-ID: 5389 | OA
Cerny P, Henzinger TA, Radhakrishna A. 2010. Simulation distances, IST Austria, 24p.
[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. CAV: Computer Aided Verification, LNCS, vol. 6174, 465–479.
[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, 27p.
[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. Oopsla Object Oriented Programming Systems Languages and Applications, 61–80.
View | DOI
 
[6]
2009 | Conference Paper | IST-REx-ID: 4391
Cerny P, Alur R. 2009. Automated Analysis of Java Methods for Confidentiality. CAV: Computer Aided Verification, LNCS, , 173–187.
View | DOI
 
[5]
2009 | Conference Paper | IST-REx-ID: 4403 | OA
Alur R, Cerny P, Weinstein S. 2009. Algorithmic analysis of array-accessing programs. CSL: Computer Science Logic, LNCS, vol. 5771, 86–101.
[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. Usenix/ Accurate Electronic Voting Technology Workshop (EVT) 08.
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. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, , 664–678.
View | DOI
 
[2]
2006 | Conference Paper | IST-REx-ID: 4401
Alur R, Cerny P, Zdancewic S. 2006. Preserving Secrecy Under Refinement. ICALP: Automata, Languages and Programming, LNCS, , 107–118.
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. POPL: Principles of Programming Languages, 98–109.
View | DOI
 

Search

Filter Publications