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.
436 Publications
2011 |
Published |
Conference Paper |
IST-REx-ID: 3360 |
U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.
[Published Version]
View
| Files available
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3361 |
P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
[Submitted Version]
View
| Files available
| DOI
| WoS
2011 |
Published |
Conference Paper |
IST-REx-ID: 3362 |
J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.
[Submitted Version]
View
| Files available
| DOI
2011 |
Submitted |
Preprint |
IST-REx-ID: 3363 |
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 |
Published |
Journal Article |
IST-REx-ID: 3364 |
F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event probabilities in noisy cellular processes,” Theoretical Computer Science, vol. 412, no. 21. Elsevier, pp. 2128–2141, 2011.
[Submitted Version]
View
| Files available
| DOI
| WoS
2011 |
Published |
Conference Paper |
IST-REx-ID: 3365 |
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
[Submitted Version]
View
| Files available
| DOI
2011 |
Published |
Conference Paper |
IST-REx-ID: 3366 |
P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
[Submitted Version]
View
| Files available
| DOI
2011 |
Published |
Journal Article |
IST-REx-ID: 3381 |
T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.
[Submitted Version]
View
| Files available
| DOI
| WoS
2011 |
Published |
Journal Article |
IST-REx-ID: 531 |
R. Guerraoui, T. A. Henzinger, and V. Singh, “Verification of STM on relaxed memory models,” Formal Methods in System Design, vol. 39, no. 3. Springer, pp. 297–331, 2011.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2011 |
Published |
Technical Report |
IST-REx-ID: 5383 |
T. Wies, M. Muñiz, and V. Kuncak, On an efficient decision procedure for imperative tree data structures. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI
2011 |
Published |
Technical Report |
IST-REx-ID: 5385 |
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI
2010 |
Published |
Conference Paper |
IST-REx-ID: 10908 |
R. Blanc, T. A. Henzinger, T. Hottelier, and L. Kovács, “ABC: Algebraic Bound Computation for loops,” in Logic for Programming, Artificial Intelligence, and Reasoning, Dakar, Senegal, 2010, vol. 6355, pp. 103–118.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2010 |
Published |
Conference Paper |
IST-REx-ID: 488 |
R. Alur and P. Cerny, “Expressiveness of streaming string transducers,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India, 2010, vol. 8, pp. 1–12.
[Published Version]
View
| Files available
| DOI
| WoS
2010 |
Published |
Technical Report |
IST-REx-ID: 5388 |
K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.
[Published Version]
View
| Files available
| DOI
2010 |
Published |
Technical Report |
IST-REx-ID: 5389 |
P. Cerny, T. A. Henzinger, and A. Radhakrishna, Simulation distances. IST Austria, 2010.
[Published Version]
View
| Files available
| DOI
2010 |
Published |
Technical Report |
IST-REx-ID: 5391 |
P. Cerny, A. Radhakrishna, D. Zufferey, S. Chaudhuri, and R. Alur, Model checking of linearizability of concurrent list implementations. IST Austria, 2010.
[Published Version]
View
| Files available
| DOI
2010 |
Published |
Conference Paper |
IST-REx-ID: 3719 |
J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions of rule-based systems,” presented at the MECBIC: Membrane Computing and Biologically Inspired Process Calculi, Jena, Germany, 2010, vol. 40, pp. 142–161.
[Submitted Version]
View
| Files available
| arXiv
2010 |
Published |
Journal Article |
IST-REx-ID: 3834 |
V. Wolf, R. Goel, M. Mateescu, and T. A. Henzinger, “Solving the chemical master equation using sliding windows,” BMC Systems Biology, vol. 4, no. 42. BioMed Central, pp. 1–19, 2010.
[Published Version]
View
| Files available
| DOI
| WoS
2010 |
Published |
Conference Paper |
IST-REx-ID: 3838 |
T. A. Henzinger, M. Mateescu, L. Mikeev, and V. Wolf, “Hybrid numerical solution of the chemical master equation,” presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy, 2010, pp. 55–65.
[Submitted Version]
View
| Files available
| DOI