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.

Filip Cano Cordoba

Fabian Kresse

Ana Oliveira da Costa

Leonard Brice

Thomas Henzinger

Pavol Kebis

Konstantin Kueffner

Stefanie Muroya Lei

Mahyar Karimi

Ashutosh Gupta

Marek Chalupa

Luka Zeleznik

Cezara Dragoi

Jan Kretinsky

Hui Kong

Samuel Pastva

Fabian Mühlböck

Kaushik Mallik

Christian Schilling

Abhinav Verma

Miriam García Soto

Jakob Ruess

Emily Yu

K. S. Thejaswini

Nicolas Mazzocchi

Roopsha Samanta

Sergiy Bogomolov

Oliveira da Costa, Ana

Anna Lukina

Guy Avni

Duc Hiep Chu

Singh, Anmol

Pavol Cerny

Mathias Lechner

Udi Boker

Dejan Nickovic

Joost Katoen

Bernhard Kragl

Przemyslaw Daca

Thomas Wies

Arjun Radhakrishna

Thomas Ferrère

Mirco Giacobbe

N. Ege Saraç

Anmol Tomar

Jan Otop

Jessica Davies

Thorsten Tarrach

Ali Sezgin

Vasu Singh

Adrian Elgyütt

Halalai, Raluca

Tatjana Petrov

Andrey Kupriyanov

Damien Zufferey



436 Publications

2011 | Published | Conference Paper | IST-REx-ID: 3360 | OA
Boker, U., & Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer. https://doi.org/10.4230/LIPIcs.CSL.2011.82
[Published Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3361 | OA
Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21
[Submitted Version] View | Files available | DOI | WoS
 
2011 | Published | Conference Paper | IST-REx-ID: 3362 | OA
Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., & Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-23217-6_27
[Submitted Version] View | Files available | DOI
 
2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv. https://doi.org/10.48550/arXiv.1104.0127
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | Journal Article | IST-REx-ID: 3364 | OA
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 | WoS
 
2011 | Published | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3366 | OA
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
 
2011 | Published | Journal Article | IST-REx-ID: 3381 | OA
Henzinger, T. A., Jobstmann, B., & Wolf, V. (2011). Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S0129054111008441
[Submitted Version] View | Files available | DOI | WoS
 
2011 | Published | Journal Article | IST-REx-ID: 531 | OA
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.) | WoS
 
2011 | Published | Technical Report | IST-REx-ID: 5383 | OA
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 | Published | Technical Report | IST-REx-ID: 5385 | OA
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
 
2010 | Published | Conference Paper | IST-REx-ID: 10908 | OA
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.) | WoS
 
2010 | Published | Conference Paper | IST-REx-ID: 488 | OA
Alur, R., & Cerny, P. (2010). Expressiveness of streaming string transducers (Vol. 8, pp. 1–12). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2010.1
[Published Version] View | Files available | DOI | WoS
 
2010 | Published | Journal Article | IST-REx-ID: 533
Hoenicke, J., Leino, K., Podelski, A., Schäf, M., & Wies, T. (2010). Doomed program points. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-010-0102-0
View | DOI | WoS
 
2010 | Published | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004
[Published Version] View | Files available | DOI
 
2010 | Published | Technical Report | IST-REx-ID: 5389 | OA
Cerny, P., Henzinger, T. A., & Radhakrishna, A. (2010). Simulation distances. IST Austria. https://doi.org/10.15479/AT:IST-2010-0003
[Published Version] View | Files available | DOI
 
2010 | Published | 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. https://doi.org/10.15479/AT:IST-2010-0001
[Published Version] View | Files available | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 3719 | OA
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 | Published | Journal Article | IST-REx-ID: 3834 | OA
Wolf, V., Goel, R., Mateescu, M., & Henzinger, T. A. (2010). Solving the chemical master equation using sliding windows. BMC Systems Biology. BioMed Central. https://doi.org/10.1186/1752-0509-4-42
[Published Version] View | Files available | DOI | WoS
 
2010 | Published | Conference Paper | IST-REx-ID: 3838 | OA
Henzinger, T. A., Mateescu, M., Mikeev, L., & Wolf, V. (2010). Hybrid numerical solution of the chemical master equation (pp. 55–65). Presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy: Springer. https://doi.org/10.1145/1839764.1839772
[Submitted Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed