Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




311 Publications

2012 | Conference Paper | IST-REx-ID: 2891 | OA
Boker, Udi, and Thomas A Henzinger. “Approximate Determinization of Quantitative Automata.” In Leibniz International Proceedings in Informatics, 18:362–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. https://doi.org/10.4230/LIPIcs.FSTTCS.2012.362.
View | Files available | DOI
 
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.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
2012 | Conference Paper | IST-REx-ID: 2936 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012. https://doi.org/10.1145/2380356.2380370.
View | DOI | Download Preprint (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2942
Henzinger, Thomas A, and Dejan Nickovic. “Independent Implementability of Viewpoints.” In Conference Proceedings Monterey Workshop 2012, 7539:380–95. Springer, 2012. https://doi.org/10.1007/978-3-642-34059-8_20.
View | DOI
 
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
 
2012 | Journal Article | IST-REx-ID: 494
Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.” ACM Transactions on Computational Logic (TOCL). ACM, 2012. https://doi.org/10.1145/2362355.2362357.
View | DOI
 
2012 | Book Chapter | IST-REx-ID: 5745 | OA
Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” In Automated Technology for Verification and Analysis, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33386-6_10.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 1384 | OA
Beyer, Dirk, Thomas A Henzinger, Mehmet Keremoglu, and Philipp Wendler. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” In Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. ACM, 2012. https://doi.org/10.1145/2393596.2393664.
View | DOI | Download Preprint (ext.)
 
2012 | Journal Article | IST-REx-ID: 3836
Ghosal, Arkadeb, Daniel Iercan, Christoph Kirsch, Thomas A Henzinger, and Alberto Sangiovanni Vincentelli. “Separate Compilation of Hierarchical Real-Time Programs into Linear-Bounded Embedded Machine Code.” Science of Computer Programming. Elsevier, 2012. https://doi.org/10.1016/j.scico.2010.06.004.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3846 | OA
Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences. Elsevier, 2012. https://doi.org/10.1016/j.jcss.2011.05.002.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3128 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design. Springer, 2012. https://doi.org/10.1007/s10703-012-0164-2.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3136
Guet, Calin C, Ashutosh Gupta, Thomas A Henzinger, Maria Mateescu, and Ali Sezgin. “Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits,” 7358:294–309. Springer, 2012. https://doi.org/10.1007/978-3-642-31424-7_24.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3155 | OA
Delahaye, Benoît, Uli Fahrenberg, Thomas A Henzinger, Axel Legay, and Dejan Nickovic. “Synchronous Interface Theories and Time Triggered Scheduling,” 7273:203–18. Springer, 2012. https://doi.org/10.1007/978-3-642-30793-5_13.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3162 | OA
Asarin, Eugene, Alexandre Donzé, Oded Maler, and Dejan Nickovic. “Parametric Identification of Temporal Properties,” 7186:147–60. Springer, 2012. https://doi.org/10.1007/978-3-642-29860-8_12.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3168
Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability Abstractions of Rule Based Systems.” Theoretical Computer Science. Elsevier, 2012. https://doi.org/10.1016/j.tcs.2011.12.059.
View | Files available | DOI
 
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
 
2012 | Conference Paper | IST-REx-ID: 3253
Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Abstract Domains for Automated Reasoning about List Manipulating Programs with Infinite Data,” 7148:1–22. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_1.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 3251 | OA
Zufferey, Damien, Thomas Wies, and Thomas A Henzinger. “Ideal Abstractions for Well Structured Transition Systems,” 7148:445–60. Springer, 2012. https://doi.org/10.1007/978-3-642-27940-9_29.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 531 | OA
Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Verification of STM on Relaxed Memory Models.” Formal Methods in System Design. Springer, 2011. https://doi.org/10.1007/s10703-011-0131-3.
View | DOI | Download Published Version (ext.)
 
2011 | Technical Report | IST-REx-ID: 5383 | OA
Wies, Thomas, Marco Muñiz, and Viktor Kuncak. On an Efficient Decision Procedure for Imperative Tree Data Structures. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0005.
View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5385 | OA
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011. https://doi.org/10.15479/AT:IST-2011-0003.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3264
Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.” edited by Hongseok Yang, 7078:188–203. Springer, 2011. https://doi.org/10.1007/978-3-642-25318-8_16.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3299 | OA
Henzinger, Thomas A, and Maria Mateescu. “Propagation Models for Computing Biochemical Reaction Networks,” 1–3. Springer, 2011. https://doi.org/10.1145/2037509.2037510.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3301 | OA
Henzinger, Thomas A, and Maria Mateescu. “Tail Approximation for the Chemical Master Equation.” Tampere International Center for Signal Processing, 2011.
View | Files available
 
2011 | Conference Paper | IST-REx-ID: 3302 | OA
Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.
View | Files available
 
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science. International Federation of Computational Logic, 2011. https://doi.org/10.2168/LMCS-7(4:8)2011.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.” In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011. https://doi.org/10.1109/SIES.2011.5953660.
View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3323
Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. https://doi.org/10.1007/978-3-642-22438-6_36.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3324 | OA
Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. https://doi.org/10.1007/978-3-642-18275-4_26.
View | DOI | Download Submitted Version (ext.)
 
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
 
2011 | Conference Paper | IST-REx-ID: 3326 | OA
Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,” 6996:482–91. Springer, 2011. https://doi.org/10.1007/978-3-642-24372-1_37.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3352
Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.” Communications of the ACM. ACM, 2011. https://doi.org/10.1145/2001269.2001289.
View | DOI
 
2011 | Journal Article | IST-REx-ID: 3353 | OA
Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS). ACM, 2011. https://doi.org/10.1145/1985342.1985345.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL). ACM, 2011. https://doi.org/10.1145/1970398.1970404.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3355 | OA
Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,” 255–64. IEEE, 2011. https://doi.org/10.1109/QEST.2011.40.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_17.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3358 | OA
Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. https://doi.org/10.1145/1966445.1966476.
View | DOI | Download Published Version (ext.)
 
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
 
2011 | Conference Paper | IST-REx-ID: 3360 | OA
Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. https://doi.org/10.4230/LIPIcs.CSL.2011.82.
View | Files available | DOI
 
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.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3362 | OA
Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. https://doi.org/10.1007/978-3-642-23217-6_27.
View | Files available | DOI
 
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.
View | Download Preprint (ext.) | arXiv
 
2011 | Journal Article | IST-REx-ID: 3364 | OA
Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes.” Theoretical Computer Science. Elsevier, 2011. https://doi.org/10.1016/j.tcs.2010.10.022.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. https://doi.org/10.1007/978-3-642-19835-9_24.
View | Files available | DOI
 
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.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3381 | OA
Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models.” IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing, 2011. https://doi.org/10.1142/S0129054111008441.
View | Files available | DOI
 
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.
View | Files available | DOI
 
2010 | Journal Article | IST-REx-ID: 533
Hoenicke, Jochen, Kari Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. “Doomed Program Points.” Formal Methods in System Design. Springer, 2010. https://doi.org/10.1007/s10703-010-0102-0.
View | DOI
 
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.
View | Files available | DOI
 

Search

Filter Publications