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.

Mahyar Karimi

N. Ege Saraç

Konstantin Kueffner

K. S. Thejaswini

Thomas Henzinger

Stefanie Muroya Lei

Emily Yu

Ana Oliveira da Costa

Marek Chalupa

Anmol Tomar

Jessica Davies

Tatjana Petrov

Dejan Nickovic

Oliveira da Costa, Ana

Hui Kong

Cezara Dragoi

Fabian Mühlböck

Roopsha Samanta

Christian Schilling

Udi Boker

Abhinav Verma

Miriam García Soto

Adrian Elgyütt

Jan Kretinsky

Guy Avni

Przemyslaw Daca

Thomas Wies

Samuel Pastva

Anna Lukina

Jan Otop

Halalai, Raluca

Singh, Anmol

Nicolas Mazzocchi

Duc Hiep Chu

Vasu Singh

Kaushik Mallik

Bernhard Kragl

Joost Katoen

Damien Zufferey

Mirco Giacobbe

Thorsten Tarrach

Ashutosh Gupta

Ali Sezgin

Mathias Lechner

Pavol Cerny

Jakob Ruess

Arjun Radhakrishna

Thomas Ferrère

Andrey Kupriyanov

Sergiy Bogomolov

Luka Zeleznik



404 Publications

2011 | Published | Conference Paper | IST-REx-ID: 3324 | OA
Decision procedures for automating termination proofs
R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3325
Streaming transducers for algorithmic verification of single pass list processing programs
R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3326 | OA
What’s decidable about weighted automata
S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Journal Article | IST-REx-ID: 3352
Biology as reactivity
J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011) 72–82.
View | DOI
 
2011 | Published | Journal Article | IST-REx-ID: 3353 | OA
A theory of synchronous relational interfaces
S. Tripakis, B. Lickly, T.A. Henzinger, E. Lee, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011).
[Submitted Version] View | Files available | DOI
 
2011 | Published | Journal Article | IST-REx-ID: 3354
Qualitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).
View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3355 | OA
Quantitative evaluation of BFT protocols
R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3356 | OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3358 | OA
Scheduling large jobs by abstraction refinement
T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3359
From boolean to quantitative synthesis
P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3360 | OA
Determinizing discounted-sum automata
U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.
[Published Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3361 | OA
The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3362 | OA
Dynamic reactive modules
J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.
[Submitted Version] View | Files available | DOI
 
2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).
[Preprint] View | Download Preprint (ext.) | arXiv
 
2011 | Published | Journal Article | IST-REx-ID: 3364 | OA
Approximation of event probabilities in noisy cellular processes
F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science 412 (2011) 2128–2141.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3365 | OA
QUASY: quantitative synthesis tool
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3366 | OA
Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Journal Article | IST-REx-ID: 3381 | OA
Formalisms for specifying Markovian population models
T.A. Henzinger, B. Jobstmann, V. Wolf, IJFCS: International Journal of Foundations of Computer Science 22 (2011) 823–841.
[Submitted Version] View | Files available | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 10908 | OA
ABC: Algebraic Bound Computation for loops
R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

Filters and Search Terms

type<>research_data

Search

Filter Publications

Display / Sort

Export / Embed