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.
300 Publications
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 | 
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 |
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 |
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 |
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science 7, no. 4 (2011). https://doi.org/10.2168/LMCS-7(4:8)2011.
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3316 |
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 |
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 |
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 54, no. 10 (2011): 72–82. https://doi.org/10.1145/2001269.2001289.
View
| DOI
2011 | Journal Article | IST-REx-ID: 3353 |
Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS) 33, no. 4 (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) 12, no. 4 (2011). https://doi.org/10.1145/1970398.1970404.
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3355 |
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 |
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 |
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 |
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 |
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