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.
387 Publications
2011 | Journal Article | IST-REx-ID: 3364 | 
Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2011). Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2010.10.022
[Submitted Version]
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 531 |
Guerraoui, R., Henzinger, T. A., & Singh, V. (2011). Verification of STM on relaxed memory models. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-011-0131-3
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3356 |
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
[Submitted Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5385 |
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5383 |
Wies, T., Muñiz, M., & Kuncak, V. (2011). On an efficient decision procedure for imperative tree data structures. IST Austria. https://doi.org/10.15479/AT:IST-2011-0005
[Published Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3323
Wies, T., Muñiz, M., & Kuncak, V. (2011). An efficient decision procedure for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the CADE 23: Automated Deduction , Wrocław, Poland: Springer. https://doi.org/10.1007/978-3-642-22438-6_36
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3366 |
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
2010 | Conference Paper | IST-REx-ID: 10908 |
Blanc, R., Henzinger, T. A., Hottelier, T., & Kovács, L. (2010). ABC: Algebraic Bound Computation for loops. In E. M. Clarke & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (Vol. 6355, pp. 103–118). Berlin, Heidelberg: Springer Nature. https://doi.org/10.1007/978-3-642-17511-4_7
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2010 | Conference Paper | IST-REx-ID: 3719 |
Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2010). Lumpability abstractions of rule-based systems (Vol. 40, pp. 142–161). Presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany: Open Publishing Association.
[Submitted Version]
View
| Files available
| arXiv
2010 | Conference Paper | IST-REx-ID: 3847 |
Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2010). SABRE: A tool for the stochastic analysis of biochemical reaction networks (pp. 193–194). Presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA: IEEE. https://doi.org/10.1109/QEST.2010.33
[Submitted Version]
View
| Files available
| DOI